Linked List reversal

Test.java

class Node{
    int data;
    Node next;

    Node(int data){
        this.data = data;
        this.next = null;
    }
}

class LinkedList{
    Node head;

    LinkedList(){
        head = null;
    }

    void add(int key){
        if(head == null){
            head = new Node(key);
            return;
        }
        /* Traverse to the end of the list */
        Node curr = head;
        while(curr.next != null){
            curr = curr.next;
        }
        /* Insert element at the end of the list */
        curr.next = new Node(key);
    }

    void printList(){
        Node curr = head;

        while(curr != null){
            System.out.print(curr.data + "->");
            curr = curr.next;
        }
        System.out.print("null");
        System.out.println();
    }

    /* Function to reverse the linked list */
    void reverse(){
        Node prev = null;
        Node curr = head;
        Node next = null;
        while(curr != null){
            next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        head = prev;
    }
}

public class Test{
    public static void main(String[] args){
        LinkedList list = new LinkedList();
        list.add(1);
        list.add(2);
        list.add(3);
        list.printList();
        list.reverse();
        list.printList();
    }
}