Reversing single linked list in C#

Question

I am trying to reverse a linked list. This is the code I have come up with:

 public static void Reverse(ref Node root)
 {
      Node tmp = root;
      Node n         


        

Answer 1

The definition of ref is unnecessary because if you make the node as a reference type, it is OK to do:

public static void Reverse(Node root)

Also, the beauty of the interview question is less consumption of memory and in place reversal. Maybe a recursive way of doing it is also asked.