A warm Hello to all the readers!
In previous posts, we have seen different kinds of linked list like Singly linked list, Doubly linked list, Xor linked list. Now in this post we will understand what is a circular linked list.
In other linked lists, the last node points to NULL. But going by the name, in circular linked list, the last node points to the first node. This means it forms a circle.
This is how a circular linked list looks.
Singly and doubly both the linked lists can be circular as seen above.
The time complexity of all the operations on circular linked list is same as that in singly or doubly linked list.
