Following are the types of Linked List
1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List
4. Doubly Circular Linked List
1. Singly Linked List
- Each node has a single link to another node is called Singly Linked List.
- Singly Linked List does not store any pointer any reference to the previous node.
- Each node stores the contents of the node and a reference to the next node in the list.
- In a singly linked list, last node has a pointer which indicates that it is the last node. It requires a reference to the first node to store a single linked list.
- It has two successive nodes linked together in linear way and contains address of the next node to be followed.
- It has successor and predecessor. First node does not have predecessor while last node does not have successor. Last node have successor reference as NULL.
- It has only single link for the next node.
- In this type of linked list, only forward sequential movement is possible, no direct access is allowed.
- In the above figure, the address of the first node is always store in a reference node known as Head or Front. Reference part of the last node must be null.
Output:
