LinkedList

A linked list
Encapsulates the functionality of a linked list. To incorporate a linked list into
a class, the class should first inherit from ListNode using the format
class SomeDataClass : public ListNode<SomeDataClass>. The class may then be
instanced using the LinkedList template like so: LinkedList<SomeDataClass> MyListOfData;. template <typename ELEMENT> class LinkedList : public LinkedListBase

LinkedListBase

Used internally to encapsulate functionality that is independent of the template parameter.

LinkedList();

LinkedList::Clear	Clears all entries from the list
LinkedList::Push_Back	Appends a new element to the list
LinkedList::Push_Front	Prepends a new element to the list
LinkedList::Pop_Back	Removes the element from the end of the list
LinkedList::Pop_Front	Removes the element from the start of the list
LinkedList::Insert	Adds an element to the list at a given position
LinkedList::Erase	Removes an element from the list at a given position
LinkedList::Size	Returns the number of elements in the list
LinkedList::Begin	Returns the index to the first member of the list
LinkedList::End	Returns the index to the last member of the list
LinkedList::Front	Returns a reference to the first member of the list
LinkedList::Back	Returns a reference to the last member of the list

ELEMENT& operator[](unsigned int Index);

Returns the element of a list whose zero-based index is Index. If Index is greater than or equal to the number of elements in the list, then the return value is nullptr.

ListNode