Single linked list
Single linked list is the simplest type of list where each node has a next pointer to point to the next node. At first head and tail both is NULL. After addition of one/more nodes the next pointer of last or tail node points to NULL. Elements can be traversed from head to tail direction only. There is no previous pointer thus traversal from tail to head is not possible. This limitation has been eliminated by doubly linked list. We have discussed about doubly linked list in the next section. Find the visual representation of the single linked list in the below figure.
Single linked list - pictorial view
Single linked list source code
Single circular linked list demo application Add a node [y/n] : y Value of this node : 1 Add a node [y/n] : y Value of this node : 10 Add a node [y/n] : y Value of this node : 100 Add a node [y/n] : n List Contains: Node 1, Value: 1 Node 2, Value: 10 Node 3, Value: 100
About our authors: Team EQA
You have viewed 1 page out of 248. Your C learning is 0.00% complete. Login to check your learning progress.
Learn on Youtube