Explain Doubly Linked List.
Doubly Linked List
A doubly linked list is a linked list in which every node
has a next pointer and a back pointer
Every node (except the last node) contains the address
of the next node, and every node (except the first node)
contains the address of the previous node.
A doubly linked list can be traversed in either direction
Labels: Data Structure