Doubly linked list
A complex type of linked list in which a node contains a pointer to the previous as well as the next node in the sequence is called a doubly linked list. The node data, the pointer to the next node in sequence (next pointer), and the pointer to the previous node (previous pointer) are the … Read more