<<< Types of linked lists | Index | Other data structures >>> |
The first and the final nodes are linked together:
Traversal begins at any node and follows the list until reaching the original node.
Most useful when one object in a list needs to access all other objects in the list.
Disadvantage: complexity of iteration.
<<< Types of linked lists | Index | Other data structures >>> |