Introduction
to Circular linked list
Circular linked list is a linked
list where all nodes are connected to form a circle. There is no NULL at the
end. A circular linked list can be a singly circular linked list or doubly
circular linked list.
In singly
linked list last node contains null pointer. In single linked list each node
has a unique predecessor and each node has a unique successive. the main
drawback of a singly linked list is that from a given node we can access all
the nodes that follow it but not the one proceeding to it to solve this problem
we make a slight modification in singly linked list by replacing the null
pointer in the last node of the list with the address of the first node.Such linked list is called Circular List.
No comments:
Post a Comment