Types of linked list
Types of Linked Lists
There are 3 different implementations of Linked List available, they are:
- Singly Linked List
- Doubly Linked List
- Circular Linked List
Let's know more about them and how they are different from each other.
Singly Linked List
Singly linked lists contain nodes which have a datapart as well as an address part i.e.
next
, which points to the next node in the sequence of nodes.
The operations we can perform on singly linked lists are insertion, deletion and traversal.
![Linear Linked List](https://www.studytonight.com/data-structures/images/linked-list-linear.png)
Doubly Linked List
In a doubly linked list, each node contains a datapart and two addresses, one for the previous node and one for the next node.
![Double Linked List](https://www.studytonight.com/data-structures/images/linked-list-double.png)
Circular Linked List
In circular linked list the last node of the list holds the address of the first node hence forming a circular chain.
![Circular Linked List](https://www.studytonight.com/data-structures/images/linked-list-circular.png)
Comments
Post a Comment