Explain about Circular Doubly Linked List?
GIAN Tutorials
10:35 PM
Circular Doubly Linked List Circular doubly linked list is a more complexed type of data structure in which a node contain pointers to its previous node as well as the next node. Circular doubly linked list doesn't contain NULL in any of the node. The last node of the list contains the address of the first node of the list. The first node of the list also contain address of the last node in its previous pointer. A circular doubly linked list is shown in the following figure. Due to the fact that a circular doubly linked list contains three parts in its structure therefore, it demands more space per node and more expensive basic operations. However, a circular doubly linked list provides easy manipulation of the pointers and the searching becomes twice as efficient. Memory Management of Circular Doubly linked list The following figure shows the way in which the memory is allocated for a circular doubly linked list. The variable head contains the address of the first ele
