Print immutable linked list in reverse

Linked List Two Pointers Stack Recursion

94.0% acceptance

Mar 31, 2026

599

106

You are given an immutable linked list, print out all values of each node in reverse with the help of the following interface: ImmutableListNode: An interface of immutable linked list, you are given the head of the list. You need to use the following functions to access the linked list (you can't access the ImmutableListNode directly): ImmutableListNode.printValue(): Print value of the current node. ImmutableListNode.getNext(): Return the next node. The input is only given to initialize the linked list internally. You must solve this problem without modifying the linked list. In other words, you must operate the linked list using only the mentioned APIs.

Solution

C++

Time O(1)

Space O(1)

LeetCode

solution.cpp

/**
 * // This is the ImmutableListNode's API interface.
 * // You should not implement it, or speculate about its implementation.
 * class ImmutableListNode {
 * public:
 *    void printValue(); // print the value of the node.
 *    ImmutableListNode* getNext(); // return the next node.
 * };
 */

class Solution {
public:
  void printLinkedListInReverse(ImmutableListNode* head) {
    if (!head) return;
    printLinkedListInReverse(head->getNext());
    head->printValue();
  }
};