Data Structures/Singly Linked Lists
created by senthil
||This page or section is an undeveloped draft or outline.
You can help to develop the work, or you can ask for assistance in the project room.
Singly Linked Lists are a type of data structure. It is a type of list. In a singly linked list each node in the list stores the contents of the node and a pointer or reference to the next node in the list. It does not store any pointer or reference to the previous node. It is called a singly linked list because each node only has a single link to another node. To store a single linked list, you only need to store a reference or pointer to the first node in that list. The last node has a pointer to nothingness to indicate that it is the last node.
See also Linked Lists.