List the advantages of a doubly linked list over singly linked list.
- Doubly linked list can be traversed in forward and backward direction.
- Every node is reachable from every node.
- Insertion operation before a given node is easy than singly linked list.
- Delete operation in double linked list is more efficient in case of address of node to be deleted is given.
- If double linked list is modelled for tree data structure, it provides ability to back-track ancestor and sibling nodes. This is really helpful for many network algorithms.
