# Doubly Linked List Data Structure In C++ With Illustration

An In-Depth Tutorial On Doubly Linked List.

A doubly linked list is a variation of the singly linked list. We are aware that the singly linked list is a collection of nodes with each node having a data part and a pointer pointing to the next node.

A doubly linked list is also a collection of nodes. Each node here consists of a data part and two pointers. One pointer points to the previous node while the second pointer points to the next node.

=> Check The In-Depth C++ Training Tutorials Here. 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 <iostream>
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->prev = NULL;

//previous of head is new node

}
/* 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) {
cout<<"Previous node is required , it cannot be NULL";
return;
}
//allocate memory for new node
struct Node* newNode = new Node;

//assign data to new node
newNode->data = new_data;

//set next of newnode to next of prev node
newNode->next = 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;

//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
newNode->prev = NULL;
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<<node->data<<"<==>";
last = node;
node = node->next;
}
if(node == NULL)
cout<<"NULL";
}

//main program
int main() {

// Insert 40 as last node

// insert 20 at the head

// Insert 10 at the beginning.

// Insert 50 at the end.

// Insert 30, after 20.

cout<<"Doubly linked list is as follows: "<<endl;
return 0;
}
```

Output:

Doubly linked list is as follows:

10<==>20<==>30<==>40<==>50<==>NULL

The above program constructs a doubly linked list by inserting the nodes using three insertion methods i.e. inserting the node at the front, inserting the node at the end and inserting the node after the given node.

Next, we demonstrate the same operation as a Java implementation.

```// Java Class for Doubly Linked List

class Node {
int data;
Node prev;
Node next;

//create a new node using constructor
Node(int d) { data = d; }
}

// insert a node at the front of the list
public void insert_front(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.prev = null;

/* 4. change prev of head node to new node */

/* 5. move the head to point to the new node */
}
//insert a node after the given prev node
public void Insert_After(Node prev_Node, int new_data)
{
//check that prev node is not null
if (prev_Node == null) {
System.out.println("The previous node is required,it cannot be NULL ");
return;
}

//allocate new node and set it to data
Node newNode = new Node(new_data);

//set next of newNode as next of prev node
newNode.next = prev_Node.next;

//set new node to next of prev node
prev_Node.next = newNode;

//set prev of newNode as prev node
newNode.prev = prev_Node;

//set prev of new node's next to newnode
if (newNode.next != null)
newNode.next.prev = newNode;
}

// Add a node at the end of the list
void insert_end(int new_data)   {
//allocate the node and set the data
Node newNode = new Node(new_data);
//set next of new node to null since its the last node
newNode.next = null;

//set new node as head if the list is null
newNode.prev = null;
return;
}
//if list is not null then traverse it till the last node and set last next to last
while (last.next != null)
last = last.next;

last.next = newNode;           //set last next to new node

newNode.prev = last;           //set last as prev of new node
}
// display the contents of linked list starting from the given node
public void displaylist(Node node)
{
Node last = null;
while (node != null) {
System.out.print(node.data + "<==>");
last = node;
node = node.next;
}
if(node == null)
System.out.print("null");
System.out.println();

}
}
class Main{
public static void main(String[] args)
{

// Insert 40.
dll.insert_end(40);

// Insert 20 at the beginning.
dll.insert_front(20);

// Insert 10 at the beginning.
dll.insert_front(10);

// Insert 50 at the end.
dll.insert_end(50);

// Insert 30, after 20.

System.out.println("Doubly linked list created is as follows: ");
}
}```

Output:

Doubly linked list created is as follows:

10<==>20<==>30<==>40<==>50<==>null

### Deletion

A node can be deleted from a doubly linked list from any position like from the front, end or any other given position or given data.

When deleting a node from the doubly linked list, we first reposition the pointer pointing to that particular node so that the previous and after nodes do not have any connection to the node to be deleted. We can then easily delete the node.

Consider the following doubly linked list with three nodes A, B, C. Let us consider that we need to delete the node B. As shown in the above series of the diagram, we have demonstrated the deletion of node B from the given linked list. The sequence of operation remains the same even if the node is first or last. The only care that should be taken is that if in case the first node is deleted, the second node’s previous pointer will be set to null.

Similarly, when the last node is deleted, the next pointer of the previous node will be set to null. If in between nodes are deleted, then the sequence will be as above.

We leave the program to delete a node from a doubly linked list. Note that the implementation will be on the lines of the insertion implementation.

Reversing a doubly linked list is an important operation. In this, we simply swap the previous and next pointers of all the nodes and also swap the head and tail pointers.

Given below is a doubly linked list: Following C++ implementation shows the Reverse Doubly Linked List.

```#include <iostream>
using namespace std;
//node declaration for doubly linked list
struct Node {
int data;
struct Node *prev, *next;
};

Node* newNode(int val)
{
Node* temp = new Node;
temp->data = val;
temp->prev = temp->next = nullptr;
return temp;
}
{
cout << head->data << " <==> ";
}
}

// Insert a new node at the head of the list
{
Node* temp = newNode(node_data);
}

// reverse the doubly linked list
{

// traverse entire list and set right next to right
while (right->next != nullptr)
right = right->next;

//swap left and right data by moving them towards each other till they meet or cross
while (left != right && left->prev != right) {

// Swap left and right pointer data
swap(left->data, right->data);

left = left->next;

right = right->prev;
}
}
int main()
{
cout << "Original doubly linked list: " << endl;
cout << "Reverse doubly linked list: " << endl;

return 0;
}
```

Output:

1 <==> 2 <==> 3 <==> 4 <==> 5

5 <==> 4 <==> 3 <==> 2 <==> 1

Here we swap the left and right pointers and move them towards each other till they meet or cross each other. Then the first and last nodes are swapped.

The next program is the Java implementation for reversing a doubly linked list. In this program also we make use of swapping of the left and right nodes as we did in our previous program.

```// Java Program to Reverse a doubly linked List using Data Swapping
class Main{
static class Node {
int data;
Node prev, next;
};

static Node newNode(int new_data)  {
Node temp = new Node();
temp.data = new_data;
temp.prev = temp.next = null;
return temp;
}

}
}

// Insert a new node at the head of the list
static Node insert(Node head, int new_data)  {
Node temp = newNode(new_data);
}

// Function to reverse the list
// traverse the list, set right pointer to end of list
while (right.next != null)
right = right.next;
// move left and right pointers and swap their data till they meet or cross each other
while (left != right && left.prev != right)   {
// Swap data of left and right pointer
int t = left.data;
left.data = right.data;
right.data = t;

left = left.next;                        // Advance left pointer
right = right.prev;                    // Advance right pointer
}
}
public static void main(String args[])
{

}
}
```

Output:

1 <==> 2 <==> 3 <==> 4 <==> 5

5 <==> 4 <==> 3 <==> 2 <==> 1

• The doubly linked list can be traversed in forward as well as backward directions, unlike singly linked list which can be traversed in the forward direction only.
• Delete operation in a doubly-linked list is more efficient when compared to singly list when a given node is given. In a singly linked list, as we need a previous node to delete the given node, sometimes we need to traverse the list to find the previous node. This hits the performance.
• Insertion operation can be done easily in a doubly linked list when compared to the singly linked list.

• As the doubly linked list contains one more extra pointer i.e. previous, the memory space taken up by the doubly linked list is larger when compared to the singly linked list.
• Since two pointers are present i.e. previous and next, all the operations performed on the doubly linked list have to take care of these pointers and maintain them thereby resulting in a performance bottleneck.

### Applications Of Doubly Linked List

A doubly linked list can be applied in various real-life scenarios and applications as discussed below.

• A Deck of cards in a game is a classic example of a doubly linked list. Given that each card in a deck has the previous card and next card arranged sequentially, this deck of cards can be easily represented using a doubly linked list.
• Browser history/cache – The browser cache has a collection of URLs and can be navigated using the forward and back buttons is another good example that can be represented as a doubly linked list.
• Most recently used (MRU) also can be represented as a doubly linked list.
• Other data structures like Stacks, hash table, the binary tree can also be constructed or programmed using a doubly linked list.

### Conclusion

A doubly linked list is a variation of the singly linked list. It differs from the singly linked list in that where each node contains an extra pointer to the previous node along with the next pointer.

This presence of an extra pointer facilitates insert, delete operations on the doubly linked list but at the same time requires extra memory to store these extra pointers.

As discussed already, the doubly linked list has various uses in real-time scenarios like browser cache, MRUs, etc. We can also represent other data structures like trees, hash tables, etc. using a doubly-linked list.