Programming
Aptitude
Syllabus
Interview Preparation
Interview Exp.
Off Campus
0
Notifications Mark All Read
- Login
- Get Prime
0
Reverse a linked list without changing links between nodes (Data reverse only) in C++
Reverse a linked list without changing links between nodes (Data reverse only)
Here, in this page we will discuss Reverse a linked list without changing links between nodes in C++. We create a vector and store the elements of the linked list and them change the linked list node data by iterating the vector in reverse manner.
Algorithm :
- Create a node say current and set it to head.
- Now, Create a vector to store the node value in it. We will iterate over all nodes of linked list and push the current node data in vector and set current to next node. Repeat this till the current node does not become NULL.
- Now, again set current to head and take a variable say j and set it to vector.size()-1.
- Now, change the current node data with vector[j] and decrement the j and set current to next node. Repeat this till current node does not become NULL.
- In this way we can Reverse a linked list without changing links between nodes in C++
C++ program to reverse a linked list
Run
#include<bits/stdc++.h>
using namespace std;
/* Link list node */
struct Node
{
int data;
struct Node *next;
Node (int data)
{
this->data = data;
next = NULL;
}
};
struct LinkedList
{
Node *head;
LinkedList ()
{
head = NULL;
}
/* Function to reverse the linked list */
void reverse ()
{
Node *current = head;
std::vector < int >element;
while (current != NULL)
{
element.push_back (current->data);
current = current->next;
}
current = head;
int i = element.size () - 1;
while (current != NULL)
{
current->data = element[i--];
current = current->next;
}
}
/* Function to print linked list */
void display ()
{
struct Node *temp = head;
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;
}
}
void insert (int data)
{
Node *temp = new Node (data);
temp->next = head;
head = temp;
}
};
/* Driver code*/
int main ()
{
LinkedList ll;
ll.insert (10);
ll.insert (20);
ll.insert (30);
ll.insert (40);
cout << "Given linked list\n";
ll.display ();
ll.reverse ();
cout << "\nReversed Linked list \n";
ll.display ();
return 0;
}
Output :
Given linked list 40 30 20 10 Reversed Linked list 10 20 30 40
Prime Course Trailer
Related Banners
Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription
Get over 200+ course One Subscription
Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others
Singly Linked List
- Introduction to Linked List in Data Structure
Click Here - Linked List in –
- Singly Linked List in –
- Insertion in singly Linked List –
- Insertion at beginning in singly Linked List –
- Insertion at nth position in singly Linked List –
- Insertion at end in singly Linked List –
- Deletion in singly Linked List –
- Deletion from beginning in singly linked list :
- Deletion from nth position in singly linked list :
- Deletion from end in singly linked list :
- Linked List Insertion and Deletion –
C | C++ | Java - Reverse a linked list without changing links between nodes (Data reverse only) –
C | C++ | Java - Reverse a linked list by changing links between nodes –
- Print reverse of a linked list without actually reversing –
- Print reverse of a linked list without actually reversing –
- Insertion in the middle Singly Linked List –
- Insertion in a Sorted Linked List –
- Delete alternate nodes of a Linked List –
- Find middle of the linked list –
- Reverse a linked list in groups of given size –
- Find kth node from end of the linked list –
- Append the last n nodes of a linked list to the beginning of the list –
- Check whether linked list is palindrome or not –
- Fold a Linked List –
- Insert at given Position –
- Deletion at given Position –
Singly Linked List
- Introduction to Linked List in Data Structure
- Linked List in – C | C++ | Java
- Singly Linked List in – C | C++ | Java
- Insertion in singly Linked List – C | C++ | Java
- Deletion in singly Linked List – C | C++ | Java
- Reverse a linked list without changing links between nodes (Data reverse only) – C | C++ | Java
- Linked List Insertion and Deletion – C | C++ | Java
- Reverse a linked list by changing links between nodes – C | C++ | Java
- Linked List insertion in the middle – C | C++ | Java
- Print reverse of a linked list without actually reversing – C |C++ | Java
- Search an element in a linked list – C | C++ | Java
- Insertion in a Sorted Linked List – C | C++ | Java
- Delete alternate nodes of a Linked List – C | C++ | Java
- Find middle of the linked list – C | C++ | Java
- Reverse a linked list in groups of given size – C | C++ | Java
- Find kth node from end of the linked list – C | C++ | Java
- Append the last n nodes of a linked list to the beginning of the list – C | C++ | Java
- Check whether linked list is palindrome or not – C | C++ | Java
- Fold a Linked List – C | C++ | Java
- Insert at a given position – C | C++ | Java
- Delete at a given position – C | C++ | Java
Login/Signup to comment