LINKED LIST
A linked list is a linear data structure (like arrays) where each element is a separate object. Each element (that is a node) of a list is comprising of two items – the data and a reference to the next node. Types of Linked List :
Singly Linked List
In this type of linked list, every node stores address or reference of next node in list and the last node has next address or reference as NULL.
Circular Singly Linked List
The 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.
Doubly Linked List
In this type of Linked list, there are two references associated with each node, One of the reference points to the next node and one to the previous node. Advantage of this data structure is that we can traverse in both the directions and for deletion we don’t need to have explicit access to previous node.
Circular Doubly Linked List
The 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.