Reversing a linked list

#1

reversing a linked list using stacks a better and a more efficient way?

#2

Hello @MadHawk,

There are multiple ways to reverse a linked list:

  1. reversing a linked list using Stack.
  2. reversing a linked list using Iterative Method (three pointers).
  3. reversing a linked list using Recursive Method.

Now comparing each one of them in terms of Time and Space Complexity:
Then all three methods have Same complexities i.e.,
Time Complexity = O(n)
Space Complexity = O(1)

So, you can use any one of them,
As there is no way possible to reverse it in less than O(n) time.
Thus, using stack is an efficient way.

Hope, this would help.
Give a like, if you are satisfied.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.