// replace this statement with your own return
public LNode reverseListRec(LNode head)
    {
        // TODO: implement this method
		  /*This method takes a reference to the head of a linked list and returns 
        the reference to the head of the linked list in the reversed order.  */
        if(head == null) { return head; }
        if(head.getLink() == null) { return head; }
        head.getLink().setLink(head);
        head.setLink(null);
        return reverseListRec(head);
         // replace this statement with your own return
    }
head.setLink(null);
return reverseListRec(head);
// replace this statement with your own return
}
public LNode reverseListRec(LNode head)
{
// TODO: implement this method
/*This method takes a reference to the head of a linked list and returns
the reference to the head of the linked list in the reversed order. */
if(head == null) { return head; }
if(head.getLink() == null) { return head; }
head.getLink().setLink(head);
head.setLink(null);
return reverseListRec(head);
// replace this statement with your own return
}
public LNode reverseListRec(LNode head)
{
// TODO: implement this method
/*This method takes a reference to the head of a linked list and returns
the reference to the head of the linked list in the reversed order. */
if(head == null) { return head; }
if(head.getLink() == null) { return head; }
head.getLink().setLink(head);
head.setLink(null);
return reverseListRec(head);
// replace this statement with your own return
}