Display Reverse (recursive) - Linked List

easy
1. You are given a partially written LinkedList class.
2. You are required to complete the body of displayReverse and displayReverseHelper functions. The function are expected to print in reverse the linked list without actually reversing it. 
3. Input and Output is managed for you. 

Note -> The online judge can't force you to write recursive function. But that is what the expectation is, the intention in to help you learn.

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1. Time complexity -> O(n)
2. Space complexity -> O(n)

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
11
1 2 3 4 5 6 7 8 9 10 11
100
200
Output
1 2 3 4 5 6 7 8 9 10 11 
11 10 9 8 7 6 5 4 3 2 1 
200 1 2 3 4 5 6 7 8 9 10 11 100 
Previous
K Reverse In Linked List
Next
Reverse Linked List (pointer - Recursive)

Related Questions