What is Circular linked list?
In Circular Linked List the Last Node rather than pointing to NULL, points to the First Node.
Singly circular linked list.
In Singly Circular Linked List the Last Node link part stores the address of first Node.
Deletion in singly circular linked list.
Deletion after a given Node in Singly circular linked list
Doubly circular linked list.
In Doubly Circular Linked List the First Node prev part stores the address of Last Node and Last Node next part stores the address of First Node.