An Example/Tutorial of a Linked List Structure.

Linked Lists are basically a type of data structure that houses in each node the data and a pointer to the next node.  A Singly-Linked List is your most basic Linked List which has each node from start to end with the end node pointing to a Null terminator.  A Doubly Linked List has nodes that point both to the next node and another node.  A Circularly Linked List is one where there is no Null terminator at the end, but instead the end node points to the first node.  The Idea is basically Head->Node->Node->End->NULL

C++ Linked List Example