A singly circular linked list is a linked list in which the last node of the list point to the first node in the list.
In Circular linked list, we can start at any node in the list & travel the whole list. For this reason we can make our external pointer to the list pointer to any node & still access all the node in the list.
No comments:
Post a Comment