Semester -3    Subject -Data Structures and Algorithms

Explain circular doubly linked list ? 

==> 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 to whatsapp

More Questions from Data Structures and Algorithms Module 3

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


View

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


View

Explain Representation of Linked List in Memory ? 


View

Explain Linked List Operations ? 


View

Define Linked List. Advantages and disadvantages of Linked List ? 


View

Write a function to delete a specified element.


View

Explain stacks and queue using linked lists ?


View