Print the last k nodes of the linked list in reverse order | Iterative Approaches

Given a linked list containing N nodes and a positive integer K where K should be less than or equal to N. The task is to print the last K nodes of the list in reverse order.

Examples:

Input : list: 1->2->3->4->5, K = 2
Output : 5 4

Input : list: 3->10->6->9->12->2->8, K = 4
Output : 8 2 12 9

The solution discussed in previous post uses recursive approach. The following article discusses three iterative approaches to solve the above problem.

Approach 1: The idea is to use stack data structure. Push all the linked list nodes data value to stack and pop first K elements and print them.

Below is the implementation of above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation to print the last k nodes
// of linked list in reverse order
#include <bits/stdc++.h>
using namespace std;
  
// Structure of a node
struct Node {
    int data;
    Node* next;
};
  
// Function to get a new node
Node* getNode(int data)
{
    // allocate space
    Node* newNode = new Node;
  
    // put in data
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
  
// Function to print the last k nodes
// of linked list in reverse order
void printLastKRev(Node* head, int k)
{
    // if list is empty
    if (!head)
        return;
  
    // Stack to store data value of nodes.
    stack<int> st;
  
    // Push data value of nodes to stack
    while (head) {
        st.push(head->data);
        head = head->next;
    }
  
    int cnt = 0;
  
    // Pop first k elements of stack and
    // print them.
    while (cnt < k) {
        cout << st.top() << " ";
        st.pop();
        cnt++;
    }
}
  
// Driver code
int main()
{
    // Create list: 1->2->3->4->5
    Node* head = getNode(1);
    head->next = getNode(2);
    head->next->next = getNode(3);
    head->next->next->next = getNode(4);
    head->next->next->next->next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation to print the last k nodes
// of linked list in reverse order
import java.util.*;
class GFG 
{
  
// Structure of a node
static class Node
{
    int data;
    Node next;
};
  
// Function to get a new node
static Node getNode(int data)
{
    // allocate space
    Node newNode = new Node();
  
    // put in data
    newNode.data = data;
    newNode.next = null;
    return newNode;
}
  
// Function to print the last k nodes
// of linked list in reverse order
static void printLastKRev(Node head, int k)
{
    // if list is empty
    if (head == null)
        return;
  
    // Stack to store data value of nodes.
    Stack<Integer> st = new Stack<Integer>();
  
    // Push data value of nodes to stack
    while (head != null
    {
        st.push(head.data);
        head = head.next;
    }
  
    int cnt = 0;
  
    // Pop first k elements of stack and
    // print them.
    while (cnt < k) 
    {
        System.out.print(st.peek() + " ");
        st.pop();
        cnt++;
    }
}
  
// Driver code
public static void main(String[] args)
{
    // Create list: 1->2->3->4->5
    Node head = getNode(1);
    head.next = getNode(2);
    head.next.next = getNode(3);
    head.next.next.next = getNode(4);
    head.next.next.next.next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
}
}
  
// This code is contributed by PrinciRaj1992

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation to print the last k nodes 
# of linked list in reverse order
import sys
import math
  
# Structure of a node 
class Node:
    def __init__(self,data):
        self.data = data
        self.next = None
          
# Function to get a new node
def getNode(data):
      
    # allocate space and return new node
    return Node(data)
  
# Function to print the last k nodes 
# of linked list in reverse order 
def printLastKRev(head,k):
  
    # if list is empty
    if not head:
        return
      
    # Stack to store data value of nodes.
    stack = []
      
    # Push data value of nodes to stack 
    while(head):
        stack.append(head.data)
        head = head.next
    cnt = 0
  
    # Pop first k elements of stack and 
    # print them.
    while(cnt < k):
        print("{} ".format(stack[-1]),end="")
        stack.pop()
        cnt += 1
          
# Driver code 
if __name__=='__main__':
  
    # Create list: 1->2->3->4->5 
    head = getNode(1)
    head.next = getNode(2)
    head.next.next = getNode(3)
    head.next.next.next = getNode(4)
    head.next.next.next.next = getNode(5)
  
    k = 4
      
    # print the last k nodes 
    printLastKRev(head,k)
  
# This Code is Contributed by Vikash Kumar 37

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation to print the last k nodes
// of linked list in reverse order
using System;
using System.Collections.Generic;
  
class GFG 
{
  
// Structure of a node
public class Node
{
    public int data;
    public Node next;
};
  
// Function to get a new node
static Node getNode(int data)
{
    // allocate space
    Node newNode = new Node();
  
    // put in data
    newNode.data = data;
    newNode.next = null;
    return newNode;
}
  
// Function to print the last k nodes
// of linked list in reverse order
static void printLastKRev(Node head, int k)
{
    // if list is empty
    if (head == null)
        return;
  
    // Stack to store data value of nodes.
    Stack<int> st = new Stack<int>();
  
    // Push data value of nodes to stack
    while (head != null
    {
        st.Push(head.data);
        head = head.next;
    }
  
    int cnt = 0;
  
    // Pop first k elements of stack and
    // print them.
    while (cnt < k) 
    {
        Console.Write(st.Peek() + " ");
        st.Pop();
        cnt++;
    }
}
  
// Driver code
public static void Main(String[] args)
{
    // Create list: 1->2->3->4->5
    Node head = getNode(1);
    head.next = getNode(2);
    head.next.next = getNode(3);
    head.next.next.next = getNode(4);
    head.next.next.next.next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
}
}
  
// This code contributed by Rajput-Ji

chevron_right


Output:

5 4 3 2

Time Complexity: O(N)
Auxiliary Space: O(N)

The auxiliary space of the above approach can be reduced to O(k). The idea is to use two pointers. Place first pointer to beginning of the list and move second pointer to k-th node form beginning. Then find k-th node from end using approach discussed in this article: Find kth node from end of linked list. After finding kth node from end push all the remaining nodes in the stack. Pop all elements one by one from stack and print them.

Below is the implementation of the above efficient approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation to print the last k nodes
// of linked list in reverse order
  
#include <bits/stdc++.h>
using namespace std;
  
// Structure of a node
struct Node {
    int data;
    Node* next;
};
  
// Function to get a new node
Node* getNode(int data)
{
    // allocate space
    Node* newNode = new Node;
  
    // put in data
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
  
// Function to print the last k nodes
// of linked list in reverse order
void printLastKRev(Node* head, int k)
{
    // if list is empty
    if (!head)
        return;
  
    // Stack to store data value of nodes.
    stack<int> st;
  
    // Declare two pointers.
    Node *first = head, *sec = head;
  
    int cnt = 0;
  
    // Move second pointer to kth node.
    while (cnt < k) {
        sec = sec->next;
        cnt++;
    }
  
    // Move first pointer to kth node from end
    while (sec) {
        first = first->next;
        sec = sec->next;
    }
  
    // Push last k nodes in stack
    while (first) {
        st.push(first->data);
        first = first->next;
    }
  
    // Last k nodes are reversed when pushed
    // in stack. Pop all k elements of stack
    // and print them.
    while (!st.empty()) {
        cout << st.top() << " ";
        st.pop();
    }
}
  
// Driver code
int main()
{
    // Create list: 1->2->3->4->5
    Node* head = getNode(1);
    head->next = getNode(2);
    head->next->next = getNode(3);
    head->next->next->next = getNode(4);
    head->next->next->next->next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
  
    return 0;
}

chevron_right


Output:

5 4 3 2

Time Complexity: O(N)
Auxiliary Space: O(k)

Approach-2:

  • Count the number of nodes in the linked list.
  • Declare an array with the number of nodes as its size.
  • Start storing the value of nodes of the linked list from the end of the array i.e. reverse manner.
  • Print k values from starting of the array.
filter_none

edit
close

play_arrow

link
brightness_4
code

#include <iostream> 
using namespace std; 
    
// Structure of a node 
struct Node { 
    int data; 
    Node* next; 
}; 
    
// Function to get a new node 
Node* getNode(int data){ 
    // allocate space 
    Node* newNode = new Node; 
    
    // put in data 
    newNode->data = data; 
    newNode->next = NULL; 
    return newNode; 
    
// Function to print the last k nodes 
// of linked list in reverse order 
void printLastKRev(Node* head, 
                     int& count, int k) {
    struct Node* cur = head;
      
    while(cur != NULL){
        count++;
        cur = cur->next;
    }
          
    int arr[count], temp = count;
    cur = head;
          
    while(cur != NULL){
        arr[--temp] = cur->data;
        cur = cur->next;
    }
      
    for(int i = 0; i < k; i++)
        cout << arr[i] << " ";
  //
// Driver code 
int main() 
    // Create list: 1->2->3->4->5 
    Node* head = getNode(1); 
    head->next = getNode(2); 
    head->next->next = getNode(3); 
    head->next->next->next = getNode(4); 
    head->next->next->next->next = getNode(5);
    head->next->next->next->next->next = getNode(10);
    
    int k = 4, count = 0; 
    
    // print the last k nodes 
    printLastKRev(head, count, k); 
    
    return 0; 

chevron_right


Output:

10 5 4 3

Time Complexity: O(N)
Auxiliary Space: O(N)

Approach-3: The idea is to first reverse the linked list iteratively as discussed in following post: Reverse a linked list. After reversing print first k nodes of the reversed list. After printing restore the list by reversing the list again.

Below is the implementation of above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation to print the last k nodes
// of linked list in reverse order
#include <bits/stdc++.h>
using namespace std;
  
// Structure of a node
struct Node {
    int data;
    Node* next;
};
  
// Function to get a new node
Node* getNode(int data)
{
    // allocate space
    Node* newNode = new Node;
  
    // put in data
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
  
// Function to reverse the linked list.
Node* reverseLL(Node* head)
{
    if (!head || !head->next)
        return head;
  
    Node *prev = NULL, *next = NULL, *curr = head;
  
    while (curr) {
        next = curr->next;
        curr->next = prev;
        prev = curr;
        curr = next;
    }
  
    return prev;
}
  
// Function to print the last k nodes
// of linked list in reverse order
void printLastKRev(Node* head, int k)
{
    // if list is empty
    if (!head)
        return;
  
    // Reverse linked list.
    head = reverseLL(head);
  
    Node* curr = head;
  
    int cnt = 0;
  
    // Print first k nodes of linked list.
    while (cnt < k) {
        cout << curr->data << " ";
        cnt++;
        curr = curr->next;
    }
  
    // Restore the list.
    head = reverseLL(head);
}
  
// Driver code
int main()
{
    // Create list: 1->2->3->4->5
    Node* head = getNode(1);
    head->next = getNode(2);
    head->next->next = getNode(3);
    head->next->next->next = getNode(4);
    head->next->next->next->next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation to print the last k nodes
// of linked list in reverse order
import java.util.*;
class GFG
{
  
// Structure of a node
static class Node 
{
    int data;
    Node next;
};
  
// Function to get a new node
static Node getNode(int data)
{
    // allocate space
    Node newNode = new Node();
  
    // put in data
    newNode.data = data;
    newNode.next = null;
    return newNode;
}
  
// Function to reverse the linked list.
static Node reverseLL(Node head)
{
    if (head == null || head.next == null)
        return head;
  
    Node prev = null, next = null, curr = head;
  
    while (curr != null)
    {
        next = curr.next;
        curr.next = prev;
        prev = curr;
        curr = next;
    }
    return prev;
}
  
// Function to print the last k nodes
// of linked list in reverse order
static void printLastKRev(Node head, int k)
{
    // if list is empty
    if (head == null)
        return;
  
    // Reverse linked list.
    head = reverseLL(head);
  
    Node curr = head;
  
    int cnt = 0;
  
    // Print first k nodes of linked list.
    while (cnt < k) 
    {
        System.out.print(curr.data + " ");
        cnt++;
        curr = curr.next;
    }
  
    // Restore the list.
    head = reverseLL(head);
}
  
// Driver code
public static void main(String[] args)
{
    // Create list: 1->2->3->4->5
    Node head = getNode(1);
    head.next = getNode(2);
    head.next.next = getNode(3);
    head.next.next.next = getNode(4);
    head.next.next.next.next = getNode(5);
  
    int k = 4;
  
    // print the last k nodes
    printLastKRev(head, k);
}
}
  
// This code is contributed by 29AjayKumar

chevron_right


C#

// C# implementation to print the last k nodes
// of linked list in reverse order
using System;

class GFG
{

// Structure of a node
public class Node
{
public int data;
public Node next;
};

// Function to get a new node
static Node getNode(int data)
{
// allocate space
Node newNode = new Node();

// put in data
newNode.data = data;
newNode.next = null;
return newNode;
}

// Function to reverse the linked list.
static Node reverseLL(Node head)
{
if (head == null || head.next == null)
return head;

Node prev = null, next = null, curr = head;

while (curr != null)
{
next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}

// Function to print the last k nodes
// of linked list in reverse order
static void printLastKRev(Node head, int k)
{
// if list is empty
if (head == null)
return;

// Reverse linked list.
head = reverseLL(head);

Node curr = head;

int cnt = 0;

// Print first k nodes of linked list.
while (cnt < k) { Console.Write(curr.data + " "); cnt++; curr = curr.next; } // Restore the list. head = reverseLL(head); } // Driver code public static void Main(String[] args) { // Create list: 1->2->3->4->5
Node head = getNode(1);
head.next = getNode(2);
head.next.next = getNode(3);
head.next.next.next = getNode(4);
head.next.next.next.next = getNode(5);

int k = 4;

// print the last k nodes
printLastKRev(head, k);
}
}

// This code is contributed by Princi Singh

Output:

5 4 3 2

Time Complexity: O(N)
Auxiliary Space: O(1)



My Personal Notes arrow_drop_up

A Programmer and A Machine learning Enthusiast

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.