Question

Advantages of doubly linked list over singly linked list in data structure

Answer 1

In single linked list(SLL) only forward traversal is possible but in double linked list both forward and backward traversal are possible.

So delete operation in double linked list is more efficient and easy.

where in SLL to delete a node we have to get the previous node address for this we have to traverse the list from beggining or we have to maintain extra pointer to save previous node address but in DLL every node has address of previous node. so no need to traverse the list again.