Doubly linkd list:
- The doubly linked list is 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.
- In a doubly linked list, a node consists of three parts:
1. node data
2. pointer to the next node in sequence (next pointer)
3. pointer to the previous node (previous pointer).Read More →