title: How to read a singly linked list backwards?
body: <p>One method which I can think of is to reverse the list and then read it.
  But this involves changing the list which is bad.<br>
  OR I can make a copy of the list and then reverse it, but this uses additional O(n) memory.
  Is there any better method which doesn't use extra memory and doesn't modify the list and runs in O(n) time</p>
  
  <p>reverse linked list code is something like this in c#</p>
  
  <pre><code>Void Reverse (Node head)
  {
      Node prev= null;
      Node current = head;
      Node nextNode = null;
  
          while (current!=null)
          {
              nextNode = current.Next;
              current.Next = prev;
              prev=current;
              current = nextNode; 
  
          }
          head = prev;
  
  }   
  </code></pre>
  
  <p>Recursive solution is  </p>
  
  <pre><code>void ReadBackWard (Node n)
  {
      if (n==null)
          return;
      else
          ReadBackward(n.Next);
  
      Console.WriteLine(n.Data);
  
  }
  </code></pre>