剑指offer 06 倒序打印链表 Java

public class PrintListFromTailToHead06 {
    static class Node {
        int val;
        Node next;
        public Node(int val){
            this.val = val;
        }
    }
    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);
        node1.next = node2;
        node2.next = node3;
        node3.next = null;
        printListFromTailToHead(node1);
    }

    private static void printListFromTailToHead(Node node) {
        if (node.next == null) {
            System.out.println(node.val);
            return;
        }
        printListFromTailToHead(node.next);
        System.out.println(node.val);
    }
}

解释：递归打印，终止条件需要注意；