Scribd
Upload
2 views

9. Data Structure - Doubly Linked List

A Doubly Linked List allows navigation in both directions, containing links to both the next and previous elements. Key operations include insertion, deletion, and display in both forward and backward manners. The document also outlines how to create and manipulate a doubly linked list using a Node class and provides examples of inserting and appending elements.

Uploaded by

natasha muunganirwa
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

9. Data Structure - Doubly Linked List

A Doubly Linked List allows navigation in both directions, containing links to both the next and previous elements. Key operations include insertion, deletion, and display in both forward and backward manners. The document also outlines how to create and manipulate a doubly linked list using a Node class and provides examples of inserting and appending elements.

Uploaded by

natasha muunganirwa
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Data Structure -

Doubly Linked List


Doubly Linked List is a variation of Linked list in which navigation is
possible in both ways, either forward and backward easily as compared
to Single Linked List. Following are the important terms to understand
the concept of doubly linked list.
 Link − Each link of a linked list can store a data called an element.
 Next − Each link of a linked list contains a link to the next link called
Next.
 Prev − Each link of a linked list contains a link to the previous link
called Prev.
 LinkedList − A Linked List contains the connection link to the first
link called First and to the last link called Last.
As per the above illustration, following are the important points to be considered.
 Doubly Linked List contains a link element called first and last.
 Each link carries a data field(s) and two link fields called next and prev.
 Each link is linked with its next link using its next link.
 Each link is linked with its previous link using its previous link.
 The last link carries a link as null to mark the end of the list.

Basic Operations
 Insertion − Adds an element at the beginning of the list.
 Deletion − Deletes an element at the beginning of the list.
 Insert Last − Adds an element at the end of the list.
 Delete Last − Deletes an element from the end of the list.
 Insert After − Adds an element after an item of the list.
 Delete − Deletes an element from the list using the key.
 Display forward − Displays the complete list in a forward manner.
 Display backward − Displays the complete list in a backward manner.
Creating Doubly linked list
We create a Doubly Linked list by using the Node class. Now we use the same approach as
used in the Singly Linked List but the head and next pointers will be used for proper
assignation to create two links in each of the nodes in addition to the data present in the node.
Inserting into Doubly Linked List
here we are going to see how to insert a node to the Doubly Link List
using the following program. The program uses a method named insert
which inserts the new node at the third position from the head of the
doubly linked list.
When the above code is executed, it produces the following result −
62 8 13 12
Appending to a Doubly linked list
Appending to a doubly linked list will add the element at the end.
When the above code is executed, it produces the following result −

62 8 12 9 45

Please note the position of the elements 9 and 45 for the append
operation.

You might also like