Following are the types of Linked List
1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List
4. Doubly Circular Linked List
3. Circular Linked List
- Circular linked list is similar to singly linked list. The only difference is that in circular linked list, the last node points to the first node in the list.
- It is a sequence of elements in which every element has link to its next element in the sequence and has a link to the first element in the sequence.
- In the above figure we see that, each node points to its next node in the sequence but the last node points to the first node in the list. The previous element stores the address of the next element and the last element stores the address of the starting element. It forms a circular chain because the element points to each other in a circular way.
- In circular linked list, the memory can be allocated when it is required because it has a dynamic size.
- Circular linked list is used in personal computers, where multiple applications are running. The operating system provides a fixed time slot for all running applications and the running applications are kept in a circular linked list until all the applications are completed. This is a real life example of circular linked list.
- We can insert elements anywhere in circular linked list, but in the array we cannot insert elements anywhere in the list because it is in the contiguous memory.
4. Doubly Circular Linked List
- Doubly circular linked list is a linked data structure which consists of a set of sequentially linked records called nodes.
- Doubly circular linked list can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.
- The above diagram represents the basic structure of Doubly Circular Linked List. In doubly circular linked list, the previous link of the first node points to the last node and the next link of the last node points to the first node.
- In doubly circular linked list, each node contains two fields called links used to represent references to the previous and the next node in the sequence of nodes.
Example: Program to perform various operations on Doubly Circular Linked List
Output:
1. Create
1. Create
2. Search
3. Delete
