There are Three Types of Linked Lists in DSA,
1. Singly Linked Lists
A Singly Linked Lists is the simplest Type of Linked Lists where each node contains data and a reference ( or Link ) to the next node in the sequence. The Last Node Points to null.
Explanation
- Node Creation: – Each Node has a value and a pointer to the next node.
- Appending Node: – New Node are added at the end.
- Traversing: – Traversal starts from the head and follows the next pointers.
2. Doubly Linked Lists
A Doubly Linked Lists extends the singly Linked Lists by having nodes with two reference : one to the next node and one to the previous node. Thus allows traversal in both directions.
Explanation
- Node Creation: – Each Node has a value, a pointer to the next node, and a pointer to the previous node.
- Appending Node: – New Node are added at the end and Linked in Both Directions.
- Traversing: – Traversal can occur in both forward and backward directions.
3. Circular Types of Linked Lists
A Circular Linked Lists can be either singly or doubly Linked. In this, The last Node points back to the first node, forming a circle.
Explanation
- Each Node:- Each Node has a value and a pointer to the next node.
- Appending Nodes: – New Nodes are added, and the last node points back to the head.
- Traversing: – Traversal starts from the head and continues until it reaches back to the head.