Defining a node in doubly linked list

Like singly linked lists, a node in a doubly linked list is its fundamental building block. Multiple nodes, when chained together, make up a doubly linked list. All operations performed on the list nodes, be they inserting, deleting, or updating data items, are performed on the list nodes.

Structure of a node

The node of a doubly linked list is a simple yet highly effective extension of the node of a singly linked list. It just has an extra pointer called  previous in every node that stores the reference to the node before it in the list. This way, we can move forward and backward from any node, and operations involving reference manipulation become much easier. A doubly linked list node has three sections