reverse linked list

gistfile1.java

public class Node {
    public Node next;
    public String label;

    public Node(String label, Node next) {
        this.label = label;
        this.next = next;
    }

    public void dump() {
        System.out.println(label);
        if (next != null) {
            next.dump();
        }
    }
    
    public static Node reverse(Node node){
        return foo(node, null);
    }

    private static Node foo(Node node, Node reversed) {
        if (node == null) {
            return reversed;
        }
        else {
            Node tmp = node.next;
            node.next = reversed;
            return foo(tmp, node);
        }
    }

    public static void main(String[] args) {
        Node C = new Node("C", null);
        Node B = new Node("B", C);
        Node A = new Node("A", B);
        Node X = reverse(A);
        X.dump();
    }
}