Question

Write node structure for a Doubly Circular Linked List.

Answer 1

In double linked list, every node has link to its previous node and next node. So, we can traverse forward by using next field and can traverse backward by using previous field. Every node in a double linked list contains three fields: field is used to store the address of the previous node in the sequence, field is used to store the address of the next node in the sequence and ‘data’ field is used to store the actual value of that node.

Circular Linked List is a form of Linked list in which the first element points to the last element and the last element points to the first element. Both Singly Linked List and Doubly Linked List can be made into a circular linked list.