title: Reversing a singly linked list without using any pointers
body: <p>When I say without using any pointers, I mean we still use the 'next' pointer field to traverse through the list, but not changing them when reversing a linked list.</p>
  
  <p>From what I could figure out there seem to be ways to this:</p>
  
  <ul>
  <li>One way is to reverse the data in the nodes without changing the pointers themselves.</li>
  <li>The second would be to create a new linked list which is a reverse of the original linked list.</li>
  </ul>
  
  <p>I would be grateful if anyone could help me on how to proceed with the first method. Other methods are also welcomed.</p>