/*
  Insert Node at the end of a linked list
  head pointer input could be NULL as well for empty list
  Node is defined as
  class Node {
     int data;
     Node next;
  }
*/
    // This is a "method-only" submission.
    // You only need to complete this method.
Node Reverse(Node head) {

  Node prev = null;
  Node curr = head;
  Node next = null;

  while(curr != null) {
    next = curr.next;
    curr.next = prev;
    prev = curr;

    curr = next;
  }

  return prev;
}

Solve reverse a linked list
Solve reverse a linked list

This helped: http://www.geeksforgeeks.org/write-a-function-to-reverse-the-nodes-of-a-linked-list/
