Doubly Linked List has the flexibility of traversing the list in both the ways i.e., forwad and backward unlike singly linked list where movement is restricted in forward direction only. Doubly Linked List contains an extra pointer to link the previous node which enables the backward traversing.
The following terminologies will be used for describing the various sections of a node in Doubly linked list :
prev : The address of the previous node is saved here
data : The data is stored here
next : The address of the next node is saved here
.
.
.
🥇Subscribe for More Content
👍Like if you like the video
💹Share with Friends
🗣️Do comments
🔥🔥🚀