Linked List 2:Reverse LL (Recursive)

public class Solution {

    public static LinkedListNode<Integer> reverse_R(LinkedListNode<Integer> head) {
        if(head==null)
            return head;
        if(head.next==null)
            return head;
        LinkedListNode<Integer> tail=head.next;
        LinkedListNode<Integer> smallhead=reverse_R(head.next);
        tail.next=head;
        head.next=null;
        return smallhead;


}
}
//or
public class Solution {
public static LinkedListNode<Integer> reverse_R(LinkedListNode<Integer> head) {
    if(head==null)
        return head;
    if(head.next==null)
        return head;
    LinkedListNode<Integer> head1=reverse_R(head.next);
 LinkedListNode<Integer> temp=head1;
   while(temp.next!=null)
   {
       temp=temp.next;
       
   }
    temp.next=head;
    head.next=null;
    return head1;
}
}