Data Structures/Singly Linked Lists
Singly Linked Lists are a type of data structure. A linked list provides an alternative to an arrey-based structure.
A linked list, in its simplest form, ia a collection of nodes that collectively form linear sequence.
In a singly linked list, each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list. It does not store any pointer or reference to the previous node.
To store a single linked list, only the reference or pointer to the first node in that list must be stored. The last node in a single linked list points to nothing.
See also Linked Lists.