Doubly Linked List
Doubly linked list is a type of linked list in which each node apart from storing its data has two links. The first link points to the previous node in the list and the second link points to the next node in the list. The first node of the list has its previous link pointing to NULL similarly the last node of the list has its next node pointing to NULL.
The two links help us to traverse the list in both backward and forward direction. But storing an extra link requires some extra space.
Q. Program to create and display a doubly linked list.
Explanation
In this program, we will create a doubly linked list and print all the nodes present in the list.
Doubly Linked List:
Doubly Linked List is a variation of the linked list. The linked list is a linear data structure which can be described as the collection of nodes. Nodes are connected through pointers. Each node contains two fields: data and pointer to the next field. The first node of the linked list is called the head, and the last node of the list is called the tail of the list.
One of the limitations of the singly linked list is that it can be traversed in only one direction that is forward. The doubly linked list has overcome this limitation by providing an additional pointer that points to the previous node. With the help of the previous pointer, the doubly linked list can be traversed in a backward direction thus making insertion and deletion operation easier to perform. So, a typical node in the doubly linked list consists of three fields:
Data represents the data value stored in the node.
Previous represents a pointer that points to the previous node.
Next represents a pointer that points to next node in the list.
Above picture represents a doubly linked list in which each node has two pointers to point to previous and next node respectively. Here, node 1 represents the head of the list. The previous pointer of the head node will always point to NULL. Next pointer of node one will point to node 2. Node 5 represents the tail of the list whose previous pointer will point to node 4, and next will point to NULL.
Algorithm
- Define a Node class which represents a node in the list. It will have three properties: data, previous which will point to the previous node and next which will point to the next node.
- Define another class for creating a doubly linked list, and it has two nodes: head and tail. Initially, head and tail will point to null.
- addNode[] will add node to the list:
- It first checks whether the head is null, then it will insert the node as the head.
- Both head and tail will point to a newly added node.
- Head's previous pointer will point to null and tail's next pointer will point to null.
- If the head is not null, the new node will be inserted at the end of the list such that new node's previous pointer will point to tail.
- The new node will become the new tail. Tail's next pointer will point to null.
- display[] will show all the nodes present in the list.
- Define a new node 'current' that will point to the head.
- Print current.data till current points to null.
- Current will point to the next node in the list in each iteration.
Doubly Linked List | Set 1 [Introduction and Insertion]
We strongly recommend to refer following post as a prerequisite of this post.
Linked List Introduction
Inserting a node in Singly Linked List
A Doubly Linked List [DLL] contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.
Following is representation of a DLL node in C language.
|
/* Node of a doubly linked list */
class Node
{
public:
int data;
Node* next; // Pointer to next node in DLL
Node* prev; // Pointer to previous node in DLL
};
// This code is contributed by shivanisinghss2110
|
|
/* Node of a doubly linked list */
struct Node {
int data;
struct Node* next; // Pointer to next node in DLL
struct Node* prev; // Pointer to previous node in DLL
};
|
|
// Class for Doubly Linked List
public class DLL {
Node head; // head of list
/* Doubly Linked list Node*/
class Node {
int data;
Node prev;
Node next;
// Constructor to create a new node
// next and prev is by default initialized as null
Node[int d] { data = d; }
}
}
|
|
# Node of a doubly linked list
class Node:
def __init__[self, next=None, prev=None, data=None]:
self.next = next # reference to next node in DLL
self.prev = prev # reference to previous node in DLL
self.data = data
|
|
// Class for Doubly Linked List
public class DLL {
Node head; // head of list
/* Doubly Linked list Node*/
public class Node {
public int data;
public Node prev;
public Node next;
// Constructor to create a new node
// next and prev is by default initialized as null
Node[int d] { data = d; }
}
}
// This code contributed by gauravrajput1
|
|
// Class for Doubly Linked List
var head; // head of list
/* Doubly Linked list Node */
class Node {
// Constructor to create a new node
// next and prev is by default initialized as null
constructor[val] {
this.data = val;
this.prev = null;
this.next = null;
}
}
// This code contributed by gauravrajput1
|
Following are advantages/disadvantages of doubly linked list over singly linked list.
Advantages over singly linked list
1] A DLL can be traversed in both forward and backward direction.
2] The delete operation in DLL is more efficient if pointer to the node to be deleted is given.
3] We can quickly insert a new node before a given node.
In singly linked list, to delete a node, pointer to the previous node is needed. To get this previous node, sometimes the list is traversed. In DLL, we can get the previous node using previous pointer.
Disadvantages over singly linked list
1] Every node of DLL Require extra space for an previous pointer. It is possible to implement DLL with single pointer though [See this and this].
2] All operations require an extra pointer previous to be maintained. For example, in insertion, we need to modify previous pointers together with next pointers. For example in following functions for insertions at different positions, we need 1 or 2 extra steps to set previous pointer.
Insertion
A node can be added in four ways
1] At the front of the DLL
2] After a given node.
3] At the end of the DLL
4] Before a given node.
1] Add a node at the front: [A 5 steps process]
The new node is always added before the head of the given Linked List. And newly added node becomes the new head of DLL. For example if the given Linked List is 10152025 and we add an item 5 at the front, then the Linked List becomes 510152025. Let us call the function that adds at the front of the list is push[]. The push[] must receive a pointer to the head pointer, because push must change the head pointer to point to the new node [See this]
Following are the 5 steps to add node at the front.
|
/* Given a reference [pointer to pointer]
to the head of a list
and an int, inserts a new node on the
front of the list. */
void push[Node** head_ref, int new_data]
{
/* 1. allocate node */
Node* new_node = new Node[];
/* 2. put in the data */
new_node->data = new_data;
/* 3. Make next of new node as head
and previous as NULL */
new_node->next = [*head_ref];
new_node->prev = NULL;
/* 4. change prev of head node to new node */
if [[*head_ref] != NULL]
[*head_ref]->prev = new_node;
/* 5. move the head to point to the new node */
[*head_ref] = new_node;
}
// This code is contributed by shivanisinghss2110
|
|
/* Given a reference [pointer to pointer] to the head of a list
and an int, inserts a new node on the front of the list. */
void push[struct Node** head_ref, int new_data]
{
/* 1. allocate node */
struct Node* new_node = [struct Node*]malloc[sizeof[struct Node]];
/* 2. put in the data */
new_node->data = new_data;
/* 3. Make next of new node as head and previous as NULL */
new_node->next = [*head_ref];
new_node->prev = NULL;
/* 4. change prev of head node to new node */
if [[*head_ref] != NULL]
[*head_ref]->prev = new_node;
/* 5. move the head to point to the new node */
[*head_ref] = new_node;
}
|
|
// Adding a node at the front of the list
public void push[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_Node = new Node[new_data];
/* 3. Make next of new node as head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
|
|
# Adding a node at the front of the list
def push[self, new_data]:
# 1 & 2: Allocate the Node & Put in the data
new_node = Node[data = new_data]
# 3. Make next of new node as head and previous as NULL
new_node.next = self.head
new_node.prev = None
# 4. change prev of head node to new node
if self.head is not None:
self.head.prev = new_node
# 5. move the head to point to the new node
self.head = new_node
# This code is contributed by jatinreaper
|
|
// Adding a node at the front of the list
public void push[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_Node = new Node[new_data];
/* 3. Make next of new node as head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
// This code is contributed by aashish2995
|
|
// Adding a node at the front of the list
function push[new_data]
{
/* 1. allocate node
* 2. put in the data */
let new_Node = new Node[new_data];
/* 3. Make next of new node as head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
// This code is contributed by saurabh_jaiswal.
|
Four steps of the above five steps are same as the 4 steps used for inserting at the front in singly linked list. The only extra step is to change previous of head.
2] Add a node after a given node.: [A 7 steps process]
We are given pointer to a node as prev_node, and the new node is inserted after the given node.
|
/* Given a node as prev_node, insert
a new node after the given node */
void insertAfter[Node* prev_node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_node == NULL]
{
coutnext = prev_node->next;
/* 5. Make the next of prev_node as new_node */
prev_node->next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node->prev = prev_node;
/* 7. Change previous of new_node's next node */
if [new_node->next != NULL]
new_node->next->prev = new_node;
}
// This code is contributed by shivanisinghss2110.
|
|
/* Given a node as prev_node, insert a new node after the given node */
void insertAfter[struct Node* prev_node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_node == NULL] {
printf["the given previous node cannot be NULL"];
return;
}
/* 2. allocate new node */
struct Node* new_node = [struct Node*]malloc[sizeof[struct Node]];
/* 3. put in the data */
new_node->data = new_data;
/* 4. Make next of new node as next of prev_node */
new_node->next = prev_node->next;
/* 5. Make the next of prev_node as new_node */
prev_node->next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node->prev = prev_node;
/* 7. Change previous of new_node's next node */
if [new_node->next != NULL]
new_node->next->prev = new_node;
}
|
|
/* Given a node as prev_node, insert a new node after the given node */
public void InsertAfter[Node prev_Node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_Node == null] {
System.out.println["The given previous node cannot be NULL "];
return;
}
/* 2. allocate node
* 3. put in the data */
Node new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
|
|
# Given a node as prev_node, insert
# a new node after the given node
def insertAfter[self, prev_node, new_data]:
# 1. check if the given prev_node is NULL
if prev_node is None:
print["This node doesn't exist in DLL"]
return
#2. allocate node & 3. put in the data
new_node = Node[data = new_data]
# 4. Make next of new node as next of prev_node
new_node.next = prev_node.next
# 5. Make the next of prev_node as new_node
prev_node.next = new_node
# 6. Make prev_node as previous of new_node
new_node.prev = prev_node
# 7. Change previous of new_node's next node */
if new_node.next is not None:
new_node.next.prev = new_node
# This code is contributed by jatinreaper
|
|
/* Given a node as prev_node, insert a new node after the given node */
public void InsertAfter[Node prev_Node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_Node == null] {
Console.WriteLine["The given previous node cannot be NULL "];
return;
}
/* 2. allocate node
* 3. put in the data */
Node new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
// This code is contributed by aashish2995
|
|
function InsertAfter[prev_Node,new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_Node == null] {
document.write["The given previous node cannot be NULL
"];
return;
}
/* 2. allocate node
* 3. put in the data */
let new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
// This code is contributed by unknown2108
|
Five of the above steps step process are same as the 5 steps used for inserting after a given node in singly linked list. The two extra steps are needed to change previous pointer of new node and previous pointer of new node’s next node.
3] Add a node at the end: [7 steps process]
The new node is always added after the last node of the given Linked List. For example if the given DLL is 510152025 and we add an item 30 at the end, then the DLL becomes 51015202530.
Since a Linked List is typically represented by the head of it, we have to traverse the list till end and then change the next of last node to new node.
Following are the 7 steps to add node at the end.
|
/* Given a reference [pointer to pointer] to the head
of a DLL and an int, appends a new node at the end */
void append[Node** head_ref, int new_data]
{
/* 1. allocate node */
Node* new_node = new Node[];
Node* last = *head_ref; /* used in step 5*/
/* 2. put in the data */
new_node->data = new_data;
/* 3. This new node is going to be the last node, so
make next of it as NULL*/
new_node->next = NULL;
/* 4. If the Linked List is empty, then make the new
node as head */
if [*head_ref == NULL]
{
new_node->prev = NULL;
*head_ref = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last->next != NULL]
last = last->next;
/* 6. Change the next of last node */
last->next = new_node;
/* 7. Make last node as previous of new node */
new_node->prev = last;
return;
}
// This code is contributed by shivanisinghss2110
|
|
/* Given a reference [pointer to pointer] to the head
of a DLL and an int, appends a new node at the end */
void append[struct Node** head_ref, int new_data]
{
/* 1. allocate node */
struct Node* new_node = [struct Node*]malloc[sizeof[struct Node]];
struct Node* last = *head_ref; /* used in step 5*/
/* 2. put in the data */
new_node->data = new_data;
/* 3. This new node is going to be the last node, so
make next of it as NULL*/
new_node->next = NULL;
/* 4. If the Linked List is empty, then make the new
node as head */
if [*head_ref == NULL] {
new_node->prev = NULL;
*head_ref = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last->next != NULL]
last = last->next;
/* 6. Change the next of last node */
last->next = new_node;
/* 7. Make last node as previous of new node */
new_node->prev = last;
return;
}
|
|
// Add a node at the end of the list
void append[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_node = new Node[new_data];
Node last = head; /* used in step 5*/
/* 3. This new node is going to be the last node, so
* make next of it as NULL*/
new_node.next = null;
/* 4. If the Linked List is empty, then make the new
* node as head */
if [head == null] {
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
|
|
# Add a node at the end of the DLL
def append[self, new_data]:
# 1. allocate node 2. put in the data
new_node = Node[data = new_data]
last = self.head
# 3. This new node is going to be the
# last node, so make next of it as NULL
new_node.next = None
# 4. If the Linked List is empty, then
# make the new node as head
if self.head is None:
new_node.prev = None
self.head = new_node
return
# 5. Else traverse till the last node
while [last.next is not None]:
last = last.next
# 6. Change the next of last node
last.next = new_node
# 7. Make last node as previous of new node */
new_node.prev = last
# This code is contributed by jatinreaper
|
|
// Add a node at the end of the list
void append[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_node = new Node[new_data];
Node last = head; /* used in step 5*/
/* 3. This new node is going
to be the last node, so
* make next of it as NULL*/
new_node.next = null;
/* 4. If the Linked List is empty,
then make the new * node as head */
if [head == null]
{
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
// This code is contributed by shivanisinghss2110
|
|
// Add a node at the end of the list
function append[new_data]
{
/* 1. allocate node
* 2. put in the data */
var new_node = new Node[new_data];
var last = head; /* used in step 5*/
/* 3. This new node is going to be the last node, so
* make next of it as NULL*/
new_node.next = null;
/* 4. If the Linked List is empty, then make the new
* node as head */
if [head == null] {
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
// This code is contributed by Rajput-Ji
|
Six of the above 7 steps are same as the 6 steps used for inserting after a given node in singly linked list. The one extra step is needed to change previous pointer of new node.
4] Add a node before a given node:
Steps
Let the pointer to this given node be next_node and the data of the new node to be added as new_data.
- Check if the next_node is NULL or not. If it’s NULL, return from the function because any new node can not be added before a NULL
- Allocate memory for the new node, let it be called new_node
- Set new_node->data = new_data
- Set the previous pointer of this new_node as the previous node of the next_node, new_node->prev = next_node->prev
- Set the previous pointer of the next_node as the new_node, next_node->prev = new_node
- Set the next pointer of this new_node as the next_node, new_node->next = next_node;
- If the previous node of the new_node is not NULL, then set the next pointer of this previous node as new_node, new_node->prev->next = new_node
- Else, if the prev of new_node is NULL, it will be the new head node. So, make [*head_ref] = new_node.
Below is the implementation of the above approach:
Code block
Output:
Created DLL is:
Traversal in forward Direction
9 1 5 7 6
Traversal in reverse direction
6 7 5 1 9
A complete working program to test above functions.
Following is complete program to test above functions.
|
// A complete working C++ program to
// demonstrate all insertion methods
#include
using namespace std;
// A linked list node
class Node
{
public:
int data;
Node* next;
Node* prev;
};
/* Given a reference [pointer to pointer]
to the head of a list
and an int, inserts a new node on the
front of the list. */
void push[Node** head_ref, int new_data]
{
/* 1. allocate node */
Node* new_node = new Node[];
/* 2. put in the data */
new_node->data = new_data;
/* 3. Make next of new node as head
and previous as NULL */
new_node->next = [*head_ref];
new_node->prev = NULL;
/* 4. change prev of head node to new node */
if [[*head_ref] != NULL]
[*head_ref]->prev = new_node;
/* 5. move the head to point to the new node */
[*head_ref] = new_node;
}
/* Given a node as prev_node, insert
a new node after the given node */
void insertAfter[Node* prev_node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_node == NULL]
{
coutnext = prev_node->next;
/* 5. Make the next of prev_node as new_node */
prev_node->next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node->prev = prev_node;
/* 7. Change previous of new_node's next node */
if [new_node->next != NULL]
new_node->next->prev = new_node;
}
/* Given a reference [pointer to pointer] to the head
of a DLL and an int, appends a new node at the end */
void append[Node** head_ref, int new_data]
{
/* 1. allocate node */
Node* new_node = new Node[];
Node* last = *head_ref; /* used in step 5*/
/* 2. put in the data */
new_node->data = new_data;
/* 3. This new node is going to be the last node, so
make next of it as NULL*/
new_node->next = NULL;
/* 4. If the Linked List is empty, then make the new
node as head */
if [*head_ref == NULL]
{
new_node->prev = NULL;
*head_ref = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last->next != NULL]
last = last->next;
/* 6. Change the next of last node */
last->next = new_node;
/* 7. Make last node as previous of new node */
new_node->prev = last;
return;
}
// This function prints contents of
// linked list starting from the given node
void printList[Node* node]
{
Node* last;
cout8->6->4->NULL
insertAfter[head->next, 8];
cout data = new_data;
/* 3. Make next of new node as head and previous as NULL
*/
new_node->next = [*head_ref];
new_node->prev = NULL;
/* 4. change prev of head node to new node */
if [[*head_ref] != NULL]
[*head_ref]->prev = new_node;
/* 5. move the head to point to the new node */
[*head_ref] = new_node;
}
/* Given a node as prev_node, insert a new node after the
* given node */
void insertAfter[struct Node* prev_node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_node == NULL] {
printf["the given previous node cannot be NULL"];
return;
}
/* 2. allocate new node */
struct Node* new_node
= [struct Node*]malloc[sizeof[struct Node]];
/* 3. put in the data */
new_node->data = new_data;
/* 4. Make next of new node as next of prev_node */
new_node->next = prev_node->next;
/* 5. Make the next of prev_node as new_node */
prev_node->next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node->prev = prev_node;
/* 7. Change previous of new_node's next node */
if [new_node->next != NULL]
new_node->next->prev = new_node;
}
/* Given a reference [pointer to pointer] to the head
of a DLL and an int, appends a new node at the end */
void append[struct Node** head_ref, int new_data]
{
/* 1. allocate node */
struct Node* new_node
= [struct Node*]malloc[sizeof[struct Node]];
struct Node* last = *head_ref; /* used in step 5*/
/* 2. put in the data */
new_node->data = new_data;
/* 3. This new node is going to be the last node, so
make next of it as NULL*/
new_node->next = NULL;
/* 4. If the Linked List is empty, then make the new
node as head */
if [*head_ref == NULL] {
new_node->prev = NULL;
*head_ref = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last->next != NULL]
last = last->next;
/* 6. Change the next of last node */
last->next = new_node;
/* 7. Make last node as previous of new node */
new_node->prev = last;
return;
}
// This function prints contents of linked list starting
// from the given node
void printList[struct Node* node]
{
struct Node* last;
printf["\nTraversal in forward direction \n"];
while [node != NULL] {
printf[" %d ", node->data];
last = node;
node = node->next;
}
printf["\nTraversal in reverse direction \n"];
while [last != NULL] {
printf[" %d ", last->data];
last = last->prev;
}
}
/* Driver program to test above functions*/
int main[]
{
/* Start with the empty list */
struct Node* head = NULL;
// Insert 6. So linked list becomes 6->NULL
append[&head, 6];
// Insert 7 at the beginning. So linked list becomes
// 7->6->NULL
push[&head, 7];
// Insert 1 at the beginning. So linked list becomes
// 1->7->6->NULL
push[&head, 1];
// Insert 4 at the end. So linked list becomes
// 1->7->6->4->NULL
append[&head, 4];
// Insert 8, after 7. So linked list becomes
// 1->7->8->6->4->NULL
insertAfter[head->next, 8];
printf["Created DLL is: "];
printList[head];
getchar[];
return 0;
}
|
|
// A complete working Java program to demonstrate all
// Class for Doubly Linked List
public class DLL {
Node head; // head of list
/* Doubly Linked list Node*/
class Node {
int data;
Node prev;
Node next;
// Constructor to create a new node
// next and prev is by default initialized as null
Node[int d] { data = d; }
}
// Adding a node at the front of the list
public void push[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_Node = new Node[new_data];
/* 3. Make next of new node as head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
// Add a node before the given node
public void InsertBefore[Node next_node, int new_data]
{
/*Check if the given nx_node is NULL*/
if[next_node == null]
{
System.out.println["The given next node can not be NULL"];
return;
}
//Allocate node, put in the data
Node new_node = new Node[new_data];
//Making prev of new node as prev of next node
new_node.prev = next_node.prev;
//Making prev of next node as new node
next_node.prev = new_node;
//Making next of new node as next node
new_node.next = next_node;
//Check if new node is added as head
if[new_node.prev != null]
new_node.prev.next = new_node;
else
head = new_node;
}
/* Given a node as prev_node, insert
a new node after the given node */
public void InsertAfter[Node prev_Node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_Node == null] {
System.out.println["The given previous node cannot be NULL "];
return;
}
/* 2. allocate node
* 3. put in the data */
Node new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
// Add a node at the end of the list
void append[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_node = new Node[new_data];
Node last = head; /* used in step 5*/
/* 3. This new node is going to be the last node, so
* make next of it as NULL*/
new_node.next = null;
/* 4. If the Linked List is empty, then make the new
* node as head */
if [head == null] {
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
// This function prints contents of
// linked list starting from the given node
public void printlist[Node node]
{
Node last = null;
System.out.println["Traversal in forward Direction"];
while [node != null] {
System.out.print[node.data + " "];
last = node;
node = node.next;
}
System.out.println[];
System.out.println["Traversal in reverse direction"];
while [last != null] {
System.out.print[last.data + " "];
last = last.prev;
}
}
/* Driver program to test above functions*/
public static void main[String[] args]
{
/* Start with the empty list */
DLL dll = new DLL[];
// Insert 6. So linked list becomes 6->NULL
dll.append[6];
// Insert 7 at the beginning. So
// linked list becomes 7->6->NULL
dll.push[7];
// Insert 1 at the beginning. So
// linked list becomes 1->7->6->NULL
dll.push[1];
// Insert 4 at the end. So linked
// list becomes 1->7->6->4->NULL
dll.append[4];
// Insert 8, after 7. So linked
// list becomes 1->7->8->6->4->NULL
dll.InsertAfter[dll.head.next, 8];
// Insert 5, before 8.So linked
// list becomes 1->7->5->8->6->4
dll.InsertBefore[dll.head.next.next, 5];
System.out.println["Created DLL is: "];
dll.printlist[dll.head];
}
}
// This code is contributed by Sumit Ghosh
|
|
# A complete working Python
# program to demonstrate all
# insertion methods
# A linked list node
class Node:
# Constructor to create a new node
def __init__[self, data]:
self.data = data
self.next = None
self.prev = None
# Class to create a Doubly Linked List
class DoublyLinkedList:
# Constructor for empty Doubly Linked List
def __init__[self]:
self.head = None
# Given a reference to the head of a list and an
# integer, inserts a new node on the front of list
def push[self, new_data]:
# 1. Allocates node
# 2. Put the data in it
new_node = Node[new_data]
# 3. Make next of new node as head and
# previous as None [already None]
new_node.next = self.head
# 4. change prev of head node to new_node
if self.head is not None:
self.head.prev = new_node
# 5. move the head to point to the new node
self.head = new_node
# Given a node as prev_node, insert a new node after
# the given node
def insertAfter[self, prev_node, new_data]:
# 1. Check if the given prev_node is None
if prev_node is None:
print["the given previous node cannot be NULL"]
return
# 2. allocate new node
# 3. put in the data
new_node = Node[new_data]
# 4. Make net of new node as next of prev node
new_node.next = prev_node.next
# 5. Make prev_node as previous of new_node
prev_node.next = new_node
# 6. Make prev_node ass previous of new_node
new_node.prev = prev_node
# 7. Change previous of new_nodes's next node
if new_node.next:
new_node.next.prev = new_node
# Given a reference to the head of DLL and integer,
# appends a new node at the end
def append[self, new_data]:
# 1. Allocates node
# 2. Put in the data
new_node = Node[new_data]
# 3. This new node is going to be the last node,
# so make next of it as None
# [It already is initialized as None]
# 4. If the Linked List is empty, then make the
# new node as head
if self.head is None:
self.head = new_node
return
# 5. Else traverse till the last node
last = self.head
while last.next:
last = last.next
# 6. Change the next of last node
last.next = new_node
# 7. Make last node as previous of new node
new_node.prev = last
return
# This function prints contents of linked list
# starting from the given node
def printList[self, node]:
print["\nTraversal in forward direction"]
while node:
print[" {}".format[node.data]]
last = node
node = node.next
print["\nTraversal in reverse direction"]
while last:
print[" {}".format[last.data]]
last = last.prev
# Driver program to test above functions
# Start with empty list
llist = DoublyLinkedList[]
# Insert 6. So the list becomes 6->None
llist.append[6]
# Insert 7 at the beginning.
# So linked list becomes 7->6->None
llist.push[7]
# Insert 1 at the beginning.
# So linked list becomes 1->7->6->None
llist.push[1]
# Insert 4 at the end.
# So linked list becomes 1->7->6->4->None
llist.append[4]
# Insert 8, after 7.
# So linked list becomes 1->7->8->6->4->None
llist.insertAfter[llist.head.next, 8]
print ["Created DLL is: "]
llist.printList[llist.head]
# This code is contributed by Nikhil Kumar Singh[nickzuck_007]
|
|
// A complete working C# program to demonstrate all
using System;
// Class for Doubly Linked List
public class DLL
{
Node head; // head of list
/* Doubly Linked list Node*/
public class Node
{
public int data;
public Node prev;
public Node next;
// Constructor to create a new node
// next and prev is by default initialized as null
public Node[int d]
{
data = d;
}
}
// Adding a node at the front of the list
public void push[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_Node = new Node[new_data];
/* 3. Make next of new node as
head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
/* Given a node as prev_node, insert
a new node after the given node */
public void InsertAfter[Node prev_Node, int new_data]
{
/*1. check if the given prev_node is NULL */
if [prev_Node == null]
{
Console.WriteLine["The given previous node cannot be NULL "];
return;
}
/* 2. allocate node
* 3. put in the data */
Node new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
// Add a node at the end of the list
void append[int new_data]
{
/* 1. allocate node
* 2. put in the data */
Node new_node = new Node[new_data];
Node last = head; /* used in step 5*/
/* 3. This new node is going
to be the last node, so
* make next of it as NULL*/
new_node.next = null;
/* 4. If the Linked List is empty,
then make the new * node as head */
if [head == null]
{
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
// This function prints contents of
// linked list starting from the given node
public void printlist[Node node]
{
Node last = null;
Console.WriteLine["Traversal in forward Direction"];
while [node != null] {
Console.Write[node.data + " "];
last = node;
node = node.next;
}
Console.WriteLine[];
Console.WriteLine["Traversal in reverse direction"];
while [last != null] {
Console.Write[last.data + " "];
last = last.prev;
}
}
/* Driver code*/
public static void Main[String[] args]
{
/* Start with the empty list */
DLL dll = new DLL[];
// Insert 6. So linked list becomes 6->NULL
dll.append[6];
// Insert 7 at the beginning.
// So linked list becomes 7->6->NULL
dll.push[7];
// Insert 1 at the beginning.
// So linked list becomes 1->7->6->NULL
dll.push[1];
// Insert 4 at the end. So linked list
// becomes 1->7->6->4->NULL
dll.append[4];
// Insert 8, after 7. So linked list
// becomes 1->7->8->6->4->NULL
dll.InsertAfter[dll.head.next, 8];
Console.WriteLine["Created DLL is: "];
dll.printlist[dll.head];
}
}
// This code is contributed by 29AjayKumar
|
|
// A complete working javascript program to demonstrate all
// Class for Doubly Linked List
var head; // head of list
/* Doubly Linked list Node */
class Node {
// Constructor to create a new node
// next and prev is by default initialized as null
constructor[d] {
this.data = d;
this.next = null;
this.prev = null;
}
}
// Adding a node at the front of the list
function push[new_data] {
/*
* 1. allocate node 2. put in the data
*/
var new_Node = new Node[new_data];
/* 3. Make next of new node as head and previous as NULL */
new_Node.next = head;
new_Node.prev = null;
/* 4. change prev of head node to new node */
if [head != null]
head.prev = new_Node;
/* 5. move the head to point to the new node */
head = new_Node;
}
// Add a node before the given node
function InsertBefore[next_node , new_data] {
/* Check if the given nx_node is NULL */
if [next_node == null] {
document.write["The given next node can not be NULL"];
return;
}
// Allocate node, put in the data
var new_node = new Node[new_data];
// Making prev of new node as prev of next node
new_node.prev = next_node.prev;
// Making prev of next node as new node
next_node.prev = new_node;
// Making next of new node as next node
new_node.next = next_node;
// Check if new node is added as head
if [new_node.prev != null]
new_node.prev.next = new_node;
else
head = new_node;
}
/*
* Given a node as prev_node, insert a new node after the given node
*/
function InsertAfter[prev_Node , new_data] {
/* 1. check if the given prev_node is NULL */
if [prev_Node == null] {
document.write["The given previous node cannot be NULL "];
return;
}
/*
* 2. allocate node 3. put in the data
*/
var new_node = new Node[new_data];
/* 4. Make next of new node as next of prev_node */
new_node.next = prev_Node.next;
/* 5. Make the next of prev_node as new_node */
prev_Node.next = new_node;
/* 6. Make prev_node as previous of new_node */
new_node.prev = prev_Node;
/* 7. Change previous of new_node's next node */
if [new_node.next != null]
new_node.next.prev = new_node;
}
// Add a node at the end of the list
function append[new_data] {
/*
* 1. allocate node 2. put in the data
*/
var new_node = new Node[new_data];
var last = head; /* used in step 5 */
/*
* 3. This new node is going to be the last node, so make next of it as NULL
*/
new_node.next = null;
/*
* 4. If the Linked List is empty, then make the new node as head
*/
if [head == null] {
new_node.prev = null;
head = new_node;
return;
}
/* 5. Else traverse till the last node */
while [last.next != null]
last = last.next;
/* 6. Change the next of last node */
last.next = new_node;
/* 7. Make last node as previous of new node */
new_node.prev = last;
}
// This function prints contents of
// linked list starting from the given node
function printlist[node] {
var last = null;
document.write["
Traversal in forward Direction "];
while [node != null] {
document.write[node.data + " "];
last = node;
node = node.next;
}
document.write[];
document.write["
Traversal in reverse direction "];
while [last != null] {
document.write[last.data + " "];
last = last.prev;
}
}
/* Driver program to test above functions */
/* Start with the empty list */
// Insert 6. So linked list becomes 6->NULL
append[6];
// Insert 7 at the beginning. So
// linked list becomes 7->6->NULL
push[7];
// Insert 1 at the beginning. So
// linked list becomes 1->7->6->NULL
push[1];
// Insert 4 at the end. So linked
// list becomes 1->7->6->4->NULL
append[4];
// Insert 8, after 7. So linked
// list becomes 1->7->8->6->4->NULL
InsertAfter[head.next, 8];
// Insert 5, before 8.So linked
// list becomes 1->7->5->8->6->4
InsertBefore[head.next.next, 5];
document.write["Created DLL is:
"];
printlist[head];
// This code is contributed by Rajput-Ji
|
Output:
Created DLL is: Traversal in forward Direction 1 7 5 8 6 4 Traversal in reverse direction 4 6 8 5 7 1Also see: Delete a node in double Link List
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
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.
Doubly Linked List
A doubly linked list is a data structure where a set of sequential links of records called nodes exist. Unlike the singly linked list, a node of a doubly linked list consists of three fields: two link fields and one information field. Two link fields provide information about the address of previous nodes and the next nodes in the sequence and one data field.
The link fields are also known as “previous” and “next” pointers and store the addresses of the previous and next nodes in the list. And the previous pointer of the very first node, as well as the next pointer of the last node points to a Null value or called a sentinel node.
Syntax:
Struct node{ int data; struct node *next, *prev; *head;Where struct keyword refers to a structure, node is the name of the structure, data is the information field which contains only integer values, *next is the pointer of type structure which holds the address of the next node in the sequential list, and *prev is the pointer of the type structure and hold the address of the previous node in the sequential list.
Doubly Linked In C++
As in the singly linked list, the doubly linked list also has a head and a tail. The previous pointer of the head is set to NULL as this is the first node. The next pointer of the tail node is set to NULL as this is the last node.
A basic layout of the doubly linked list is shown in the below diagram.
In the above figure, we see that each node has two pointers, one pointing to the previous node and the other pointing to the next node. Only the first node [head] has its previous node set to null and the last node [tail] has its next pointer set to null.
As the doubly linked list contains two pointers i.e. previous and next, we can traverse it into the directions forward and backward. This is the main advantage of doubly linked list over the singly linked list.
Declaration
In C-style declaration, a node of the doubly linked list is represented as follows:
struct node { struct node *prev; int data; struct node *next; };Apart from the above declaration, we can also represent a node in the doubly linked list as a class in C++. A doubly linked list is represented as a class when we use STL in C++. We can implement a doubly linked list using a class in Java as well.
Basic Operations
Following are some of the operations that we can perform on a doubly linked list.
Insertion
Insertion operation of the doubly linked list inserts a new node in the linked list. Depending on the position where the new node is to be inserted, we can have the following insert operations.
- Insertion at front – Inserts a new node as the first node.
- Insertion at the end – Inserts a new node at the end as the last node.
- Insertion before a node – Given a node, inserts a new node before this node.
- Insertion after a node – Given a node, inserts a new node after this node.
Deletion
Deletion operation deletes a node from a given position in the doubly linked list.
- Deletion of the first node – Deletes the first node in the list
- Deletion of the last node – Deletes the last node in the list.
- Deletion of a node given the data – Given the data, the operation matches the data with the node data in the linked list and deletes that node.
Traversal
Traversal is a technique of visiting each node in the linked list. In a doubly linked list, we have two types of traversals as we have two pointers with different directions in the doubly linked list.
- Forward traversal – Traversal is done using the next pointer which is in the forward direction.
- Backward traversal – Traversal is done using the previous pointer which is the backward direction.
Reverse
This operation reverses the nodes in the doubly linked list so that the first node becomes the last node while the last node becomes the first node.
Search
Search operation in the doubly linked list is used to search for a particular node in the linked list. For this purpose, we need to traverse the list until a matching data is found.
Insertion
Insert a node at the front
Insertion of a new node at the front of the list is shown above. As seen, the previous new node N is set to null. Head points to the new node. The next pointer of N now points to N1 and previous of N1 that was earlier pointing to Null now points to N.
Insert node at the end
Inserting node at the end of the doubly linked list is achieved by pointing the next pointer of new node N to null. The previous pointer of N is pointed to N5. The ‘Next’ pointer of N5 is pointed to N.
Insert node before/after given node
As shown in the above diagram, when we have to add a node before or after a particular node, we change the previous and next pointers of the before and after nodes so as to appropriately point to the new node. Also, the new node pointers are appropriately pointed to the existing nodes.
The following C++ program demonstrates all the above methods to insert nodes in the doubly linked list.
#include using namespace std; // A doubly linked list node struct Node { int data; struct Node* next; struct Node* prev; }; //inserts node at the front of the list void insert_front[struct Node** head, int new_data] { //allocate memory for New node struct Node* newNode = new Node; //assign data to new node newNode->data = new_data; //new node is head and previous is null, since we are adding at the front newNode->next = [*head]; newNode->prev = NULL; //previous of head is new node if [[*head] != NULL] [*head]->prev = newNode; //head points to new node [*head] = newNode; } /* Given a node as prev_node, insert a new node after the given node */void insert_After[struct Node* prev_node, int new_data] { //check if prev node is null if [prev_node == NULL] { coutnext = prev_node->next; //set next of prev node to newnode prev_node->next = newNode; //now set prev of newnode to prev node newNode->prev = prev_node; //set prev of new node's next to newnode if [newNode->next != NULL] newNode->next->prev = newNode; } //insert a new node at the end of the list void insert_end[struct Node** head, int new_data] { //allocate memory for node struct Node* newNode = new Node; struct Node* last = *head; //set last node value to head //set data for new node newNode->data = new_data; //new node is the last node , so set next of new node to null newNode->next = NULL; //check if list is empty, if yes make new node the head of list if [*head == NULL] { newNode->prev = NULL; *head = newNode; return; } //otherwise traverse the list to go to last node while [last->next != NULL] last = last->next; //set next of last to new node last->next = newNode; //set last to prev of new node newNode->prev = last; return; } // This function prints contents of linked list starting from the given node void displayList[struct Node* node] { struct Node* last; while [node != NULL] { cout