10. LINKED LIST: An introduction to Doubly linked list [ANIMATED] | Data Structure Full Course
A Doubly linked list is a linear collection of data elements, called nodes, where node N is divided
into three parts:
(1) An information field DATA which contains the data of N
(2) A pointer field NEXT which contains the address of the next node in the list
(3) A pointer field PREV which contains the address of the preceding node in the list
Doubly linked list or Two-way list can be traversed in two directions: in the usual forward direction from the beginning of the list to the end (Singly linked list), or in the backward direction i.e., from the end of the list to the beginning (of course, the pointers should be pointing to the earlier nodes in the list). Furthermore, given the location LOC of a node N in the list, one now has immediate access to both the next node and the preceding node in the list. This means, in particular, that one is able to delete N from the list without traversing any part of the list.
My socials:
[email protected]
https://psnacademy.in
/ psnayak
/ psnayakeducator
https://www.buymeacoffee.com/psnayak
/ psnayak2007
Note: This video is copyrighted, no part of it to be reproduced or republished.
Thumbnail background image by Gya Than Arts from Pixabay.