C++ Program For Swapping Nodes In A Linked List Without Swapping Data

C++ Program For Printing Reverse Of A Linked List Without Actually Reversing

Last Updated : 08 Jul, 2022

Given a linked list, print reverse of it using a recursive function. For example, if the given linked list is 1->2->3->4, then output should be 4->3->2->1.
Note that the question is only about printing the reverse. To reverse the list itself see this
Difficulty Level: Rookie

reverse-a-link-list

Algorithm:

printReverse(head)
  1. call print reverse for head->next
  2. print head->data

Implementation:

C++

// C++ program to print reverse of a linked list 
#include <bits/stdc++.h>
using namespace std;
 
// Link list node 
class Node 
{ 
    public:
    int data; 
    Node* next; 
}; 
 
// Function to reverse the 
// linked list 
void printReverse(Node* head) 
{ 
    // Base case 
    if (head == NULL) 
    return; 
 
    // Print the list after head node 
    printReverse(head->next); 
 
    // After everything else is printed, 
    // print head 
    cout << head->data << " "; 
} 
 
// UTILITY FUNCTIONS
/* Push a node to linked list. 
   Note that this function 
   changes the head */
void push(Node** head_ref, 
          char new_data) 
{ 
    // Allocate node 
    Node* new_node = new Node();
 
    // Put in the data 
    new_node->data = new_data; 
 
    // Link the old list off the 
    // new node 
    new_node->next = (*head_ref); 
 
    // Move the head to point to 
    // the new node 
    (*head_ref) = new_node; 
} 
 
// Driver code
int main() 
{ 
    // Let us create linked list 
    // 1->2->3->4 
    Node* head = NULL; 
    push(&head, 4); 
    push(&head, 3); 
    push(&head, 2); 
    push(&head, 1); 
     
    printReverse(head); 
    return 0; 
} 
// This code is contributed by rathbhupendra

Output:

4 3 2 1

Time Complexity: O(n)

Space Complexity: O(n) for call stack since using recursion

Please refer complete article on Print reverse of a Linked List without actually reversing for more details!

C++ Program For Swapping Nodes In A Linked List Without Swapping Data

kartik

Improve

Article Tags :

Practice Tags :

Similar Reads

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

C++ Program For Reversing Alternate K Nodes In A Singly Linked List

Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way. Give the complexity of your algorithm. Example: Inputs: 1->2->3->4->5->6->7->8->9->NULL and k = 3 Output: 3->2->1->4->5->6-

C++ Program For Swapping Nodes In A Linked List Without Swapping Data

Given a linked list and two keys in it, swap nodes for two given keys. Nodes should be swapped by changing links. Swapping data of nodes may be expensive in many situations when data contains many fields. It may be assumed that all keys in the linked list are distinct. Examples: Input : 10->15-

C++ Program For Printing Nth Node From The End Of A Linked List

Given a Linked List and a number n, write a function that returns the value at the n'th node from the end of the Linked List.For example, if the input is below list and n = 3, then output is "B" Recommended: Please solve it on "PRACTICE" first, before moving on to the solution. Method 1 (Use length

C++ Program For Alternating Split Of A Given Singly Linked List- Set 1

Write a function AlternatingSplit() that takes one list and divides up its nodes to make two smaller lists 'a' and 'b'. The sublists should be made from alternating elements in the original list. So if the original list is 0->1->0->1->0->1 then one sublist should be 0->0->0 and

C++ Program For Pointing To Next Higher Value Node In A Linked List With An Arbitrary Pointer

Given singly linked list with every node having an additional "arbitrary" pointer that currently points to NULL. Need to make the "arbitrary" pointer point to the next higher value node. We strongly recommend to minimize your browser and try this yourself first A Simple Solution is to traverse all n

C++ Program to Print a given matrix in reverse spiral form

Given a 2D array, print it in reverse spiral form. We have already discussed Print a given matrix in spiral form. This article discusses how to do the reverse printing. See the following examples. Input: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Output: 10 11 7 6 5 9 13 14 15 16 12 8 4 3 2 1 Input: 1 2

C++ Program For Pointing Arbit Pointer To Greatest Value Right Side Node In A Linked List

Given singly linked list with every node having an additional â€œarbitraryâ€ pointer that currently points to NULL. We need to make the â€œarbitraryâ€ pointer to the greatest value node in a linked list on its right side. A Simple Solution is to traverse all nodes one by one. For every node, find the node

C++ Program For Adding 1 To A Number Represented As Linked List

Number is represented in linked list such that each digit corresponds to a node in linked list. Add 1 to it. For example 1999 is represented as (1-> 9-> 9 -> 9) and adding 1 to it should change it to (2->0->0->0) Recommended: Please solve it on "PRACTICE" first, before moving on to

C++ Program For Cloning A Linked List With Next And Random Pointer- Set 2

We have already discussed 2 different ways to clone a linked list. In this post, one more simple method to clone a linked list is discussed. Recommended: Please solve it on "PRACTICE" first, before moving on to the solution. The idea is to use Hashing. Below is algorithm.Â Traverse the original link