➜
  KUMAR SHIVAM

Explain circular doubly linked list ? 

Data Structures and Algorithms

Answer in Short

 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.

Explanation
1223    0

==> 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.





Share:   

More Questions from Data Structures and Algorithms Module 3

Define Linked List. Advantages and disadvantages of Linked List ? 

Define linked list. Explain Types of Linked Lists ? 

Explain Representation of Linked List in Memory ? 

Explain Linked List Operations ? 

Define node.  Write functions to insert the node at front and rear end ? 

6 Write functions to delete node from front and rear end.

Define ordered linked list. Write functions to insert into ordered linked list ? 

Write a function to delete a specified element.

Explain circular doubly linked list ? 

Explain circular doubly linked list with header node ? 

Explain sparse matrix representation ? 

Explain stacks and queue using linked lists ?