Reversing a linked list

Question

Problem in Reversing a linked list without using recursion.

I used this method, but when i try and run this back home, I am not able to print the reverse of the lin

Answer 1

Consider what the recursive method does when you're printing the links. It doesn't actually do anything until it has them all (i.e. it's placing each call on the stack, then when the base case is reached, it pops elements from the stack).

What non-stack structure do you have readily available that could be used to store the reverse of the list, then let you print it out?