Print reverse of a linked list without actually reversing

That is a linked list traversal problem, Displaying the linked list node in reverse order without effect (modified) in original linked list. Lets see few example.

Example A
Input List : 1 → 2 → 8 → 4 → 9 → 6 → NULL
Output     : 6   9   4   8   2   1
Example B
Input List : 1 → 2 → 3 → NULL
Output     : 3   2   1

This problem are targeted to understand iterative and recursive mechanism in programming language. Because recursion is simplest solution of this problem. And iterative is based on stack data structure. This post are based on recursive solution.

1) Print reverse view of linked list without modify in java 2) Print reverse view of linked list using recursion in c++ 3) Print reverse order of linked list with recursion in c 4) Reversal order of linked list using recursion in c# 5) Reversal order of linked list using recursion in php 6) Reversal order of linked list with recursion in node js 7) Reversal order of linked list using recursion in ruby 8) Reversal order of linked list using recursion in scala 9) Reversal order of linked list using recursion in swift 10) Reversal order of linked list with recursion in kotlin 11) Reversal order of linked list using recursion in python 12) Reversal order of linked list with recursion in golang 13) Reversal order of linked list using recursion in vb.net 14) Reversal order of linked list using recursion in typescript