2.9 Introduction to Doubly Linked List in Data structures |
DSA Tutorials
Jenny's Lectures CS IT
A doubly linked list is having only a single link. This link single link to its next node. Each node is
having three parts one is data part. This is address part and this part is what address part.
ADdress part is going to a store address of next node. Right 100 200 400 is I'm taking
addresses in memory random addresses.. C is a doubly linked list two links are there double
links. THe data type of this node is what struct node. This complete is what data die we have
defined our own data type. THis is user defined anytime that is a struct node. Two parts are
there that is. This is having integer data type and says a pointer pointer pointer to the next
node.. THe concept of doubly linked list came into picture as a result of the concept. THe idea is
that you can. traverse the linked list in forward direction as well as in backward direction
because two links are there, but in this case we can go only forward. IN. This case, deletion is
easy. If you want to delete a node, then only one pointer is enough, but here we have to maintain
what two pointers for deletion and insertion is also easy..
IN next lecture we will discuss how to implement a doubly linked list have to perform insertion
operation deletion operation and how to traverse how to display the data. data, then this data
and the statement this data because you we can traverse this list in backward Direction also
because of this link.
DSA Tutorials
Jenny's Lectures CS IT
A doubly linked list is having only a single link. This link single link to its next node. Each node is
having three parts one is data part. This is address part and this part is what address part.
ADdress part is going to a store address of next node. Right 100 200 400 is I'm taking
addresses in memory random addresses.. C is a doubly linked list two links are there double
links. THe data type of this node is what struct node. This complete is what data die we have
defined our own data type. THis is user defined anytime that is a struct node. Two parts are
there that is. This is having integer data type and says a pointer pointer pointer to the next
node.. THe concept of doubly linked list came into picture as a result of the concept. THe idea is
that you can. traverse the linked list in forward direction as well as in backward direction
because two links are there, but in this case we can go only forward. IN. This case, deletion is
easy. If you want to delete a node, then only one pointer is enough, but here we have to maintain
what two pointers for deletion and insertion is also easy..
IN next lecture we will discuss how to implement a doubly linked list have to perform insertion
operation deletion operation and how to traverse how to display the data. data, then this data
and the statement this data because you we can traverse this list in backward Direction also
because of this link.
