LinkedList reverseList(LinkedList n){

/* all these are null values */
Node current;
Node prev;
Node prev_link;


current = n;
while(current.next != null){
  prev = current;
  prev.next = prev_link;
  prev_link = current;
  current = current.next;
  if(current.next == null){
    current.next = prev;
  }
}

return current;
}