Reverse a linked list using recursion.
Example :
Given 1->2->3->4->5->NULL,
return 5->4->3->2->1->NULL.
Constraints:
The number of nodes in the list is the range [0, 5000].
-5000 <= Node.val <= 5000
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
