30-08-2017, 12:04 PM
In a linked list, to access any linked list node, we begin to traverse from the first node. If we are at any node in the center of the list, then it is not possible to access the nodes that precede the given node. This problem can be solved by slightly modifying the structure of the linked list. In a linked list, the next part (pointer to the next node) is NULL, if we use this link to point to the first node then we can reach the previous nodes. Refer to this for more advantages of linked circular lists.
The structure thus formed is circular with a single linked list like this:
The structure thus formed is circular with a single linked list like this: