C++ Program For Reversing A Doubly Linked List
Given a Doubly Linked List, the task is to reverse the given Doubly Linked List.
See below diagrams for example.Â
(a) Original Doubly Linked List
(b) Reversed Doubly Linked List
Here is a simple method for reversing a Doubly Linked List. All we need to do is swap prev and next pointers for all nodes, change prev of the head (or start) and change the head pointer in the end.
C++
#include <bits/stdc++.h>
using namespace std;
class Node
{
public :
int data;
Node *next;
Node *prev;
};
void reverse(Node **head_ref)
{
Node *temp = NULL;
Node *current = *head_ref;
while (current != NULL)
{
temp = current->prev;
current->prev = current->next;
current->next = temp;
current = current->prev;
}
if (temp != NULL )
*head_ref = temp->prev;
}
void push(Node** head_ref, int new_data)
{
Node* new_node = new Node();
new_node->data = new_data;
new_node->prev = NULL;
new_node->next = (*head_ref);
if ((*head_ref) != NULL)
(*head_ref)->prev = new_node ;
(*head_ref) = new_node;
}
void printList(Node *node)
{
while (node != NULL)
{
cout << node->data << " " ;
node = node->next;
}
}
int main()
{
Node* head = NULL;
push(&head, 2);
push(&head, 4);
push(&head, 8);
push(&head, 10);
cout <<
"Original Linked list" << endl;
printList(head);
reverse(&head);
cout <<
"Reversed Linked list" << endl;
printList(head);
return 0;
}
|
Output:Â
Original linked list
10 8 4 2
The reversed Linked List is
2 4 8 10
Time Complexity: O(N), where N denotes the number of nodes in the doubly linked list.
Auxiliary Space: O(1)
We can also swap data instead of pointers to reverse the Doubly Linked List. Method used for reversing array can be used to swap data. Swapping data can be costly compared to pointers if the size of the data item(s) is more.
Please write comments if you find any of the above codes/algorithms incorrect, or find better ways to solve the same problem.
Method 2:Â
The same question can also be done by using Stacks.Â
Steps:
- Keep pushing the node’s data in the stack. -> O(n)
- The keep popping the elements out and updating the Doubly Linked List
C++
#include <bits/stdc++.h>
using namespace std;
struct LinkedList
{
struct Node
{
int data;
Node *next, *prev;
Node( int d)
{
data = d;
next = prev = NULL;
}
};
Node* head = NULL;
void reverse()
{
stack< int > st;
Node* temp = head;
while (temp != NULL)
{
st.push(temp->data);
temp = temp->next;
}
temp = head;
while (temp != NULL)
{
temp->data = st.top();
st.pop();
temp = temp->next;
}
}
void Push( int new_data)
{
Node* new_node =
new Node(new_data);
new_node->prev = NULL;
new_node->next = head;
if (head != NULL)
{
head->prev = new_node;
}
head = new_node;
}
void printList(Node* node)
{
while (node)
{
cout << node->data << " " ;
node = node->next;
}
}
};
int main()
{
LinkedList list;
list.Push(2);
list.Push(4);
list.Push(8);
list.Push(10);
cout <<
"Original linked list " << endl;
list.printList(list.head);
list.reverse();
cout << endl;
cout <<
"The reversed Linked List is " << endl;
list.printList(list.head);
}
|
Output
Original linked list
10 8 4 2
The reversed Linked List is
2 4 8 10
Time Complexity: O(N)
Auxiliary Space: O(N)
In this method, we traverse the linked list once and add elements to the stack, and again traverse the whole for updating all the elements. The whole takes 2n time, which is the time complexity of O(n).
Please refer complete article on Reverse a Doubly Linked List for more details!
Last Updated :
14 Dec, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...