Reverse linked list

1. Iterative

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

2. Recursive

public void reverse(p){
    if(p.next == null){ //exit condition
            head = p;
            return;
    }
    reverse(p.next);
    ListNode q = p.next;
    q.next = p;
    p.next = null;
}