Question: Describe a fast recursive algorithm for reversing a singly linked list L, so that the ordering of the nodes becomes opposite of what it was
Describe a fast recursive algorithm for reversing a singly linked list L, so that the ordering of the nodes becomes opposite of what it was before.
Step by Step Solution
3.39 Rating (168 Votes )
There are 3 Steps involved in it
Let us define a method reverseLn which reverses the f... View full answer
Get step-by-step solutions from verified subject matter experts
