【链表】逆序打印链表

public class Main {

    // 逆序打印链表
    public void reversePrint(Node node) {
        if (node == null){
            return;
        }
        reversePrint(node.next);
        System.out.println(node.data);
    }

    public Node createListNodes() {
        Node node7 = new Node(7, null);
        Node node6 = new Node(6, node7);
        Node node5 = new Node(5, node6);
        Node node4 = new Node(4, node5);
        Node node3 = new Node(3, node4);
        Node node2 = new Node(2, node3);
        Node node1 = new Node(1, node2);
        Node head = new Node(0, node1); // head pointer

        return head;
    }

    public static void main(String[] args) {
        Main main = new Main();
        main.reversePrint(main.createListNodes().next);

    }

}