Reverse a LinkedList

public ListNode reverse(ListNode head){
if(head==null)
return null;
if(head.next==null)
return head;
ListNode current=head;
ListNode prev=null;
ListNode temp=null;
while(current!=null){
temp=current.next;
current.next=prev;
prev=current;
current=temp;
}
return prev;
}

Recursive way:

Recursive Method:

reverseList(List, NULL)

Node * reverseList(Node *node, Node *remainder)
{
Node *tmpNode;
if (node==NULL) return remainder;
tmpNode= node->next;
node->next = remainder;
reverseList(tmpNode, node);

}