Doubly Linked List
Nilu Kumari
Software Developer | Java | SQL | Data Structure & Algorithms | OOPS | JavaScript | HTML | CSS | Advance Java | Collection framework
Doubly Linked List:-
A doubly linked list is a special type of linked list in which each node contains a pointer to the previous node as well as the next node of the linked list.
Advantages of Doubly Linked List over the singly linked list
- A DLL can be traversed in both forward and backward directions.
- The delete operation in DLL is more efficient if a pointer to the node to be deleted is given.
- We can quickly insert a new node before a given node.
- In a singly linked list, to delete a node, a pointer to the previous node is needed. To get this previous node, sometimes the previous node using the previous pointer.