Data Structures/Singly Linked Lists

From Wikibooks, open books for an open world
Jump to navigation Jump to search

Singly Linked Lists are a type of data structure. In a singly linked list, each node in the list stores the contents and a pointer or reference to the next node in 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.