Python Program For Printing Reverse Of A Linked List Without Actually Reversing
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
printReverse(head) 1. call print reverse for head->next 2. print head->data
4 3 2 1
Time Complexity: O(n)
Please refer complete article on Print reverse of a Linked List without actually reversing for more details!