doubly linked list.pdf

basic description of doubly linked list

1. DOUBLY LINKED LIST
DONE BY: SHRADDHA NAKUM

2. # CONTENT
1
Explanation
2
Example
3
Advantage
4
Disadvantage

3. 1] EXPLANATION
• It is also called two way linked list.
• In this list in which node are linked together by multiple links.
• So we access successor(next) node and predecessor(previous) node.
• Therefore each node in a list points both node.
• This help us to traverse in both direction.

4. L and R in image denote left most
and right mode in the list.
Left link of L node and right link
of R node is NULL,
So its indicating the end of list for
each directions.
CONTINUE

5. In figure 5 , 10 and 15 are the info
part of doubly linked list.
1020 , 1030 and 1035 is link part
(address) of this list.
2] EXAMPLE
Left link of L node and right link
of R node is always NULL,
we can see here that lpt contain
previous node of address and rpt
contain next node of address so
we can traverse in both direction.

6. We can delete a node with little trouble,since we have pointers to the previous and next
nodes.
A node on a singlylinked list cannot be removed unless we have the pointerto its
predecessor.
3] ADVANTAGE
Main advantage of doublylinked list is we can traverse in any direction, Forward or
reverse

7. 4] DISADVANTAGE
It requires more memory compared to singlylinked list because we need an extra
pointer to point previous node.
Operations require more time compared to singly-linked lists.

8. THANK YOU!
Made by : Shraddha M Nakum
Enrollment No. : 200002047
Roll No. : 7
Division ; BY1
Branch : Computer Engineering

Atmiya University