Description of Circular Linked List. More...

Description of Circular Linked List.

A Circular list is a chain of nodes, without any termination. The last node is linked back to the first node. A node is a data structure which contains user data. The following are the operations supported by Circular List implementation:

• Adds a node at the beginning of the list.
• Adds a node at the end of the list.
• Adds a node before a specific node in the list.
• Adds a node after a specific node in the list.
• Returns the first node from the list.
• Returns the last node from the list.
• Returns the previous node from the list.
• Returns the next node from the list.
• Walks through the list, starting from a specific node.
• Deletes a node from the list.
• Returns the number of nodes from the list.
• Retrieves the data from a node from the list.
• Destroys the list.

Before performing any of the above mentioned operations, you must create a list. While creating a list, you need to specify the maximum size for the list. If the maximum size is specified as 0, then you can add any number of nodes. Otherwise, the number of nodes you can add is limited to the maximum size. At any instant, the list can have a maximum of maxSize number of nodes, specified when the list is created.

Interaction with other components

Circular List APIs depend on Heap for memory allocation and functions to free the allocated memory.