JAVA -打印节点+二叉树的深度

class Node {
    int value;
    Node left;
    Node right;

    public Node(int value) {
        this.value = value;
        this.left = null;
        this.right = null;
    }
}

public class BinaryTree {
    Node root;

    public BinaryTree() {
        root = null;
    }

    public void printNodes(Node node) {
        if (node == null) {
            return;
        }

        System.out.print(node.value + " ");
        printNodes(node.left);
        printNodes(node.right);
    }

    public int getDepth(Node node) {
        if (node == null) {
            return 0;
        }

        int leftDepth = getDepth(node.left);
        int rightDepth = getDepth(node.right);

        return Math.max(leftDepth, rightDepth) + 1;
    }

    public static void main(String[] args) {
        BinaryTree tree = new BinaryTree();
        tree.root = new Node(1);
        tree.root.left = new Node(2);
        tree.root.right = new Node(3);
        tree.root.left.left = new Node(4);
        tree.root.left.right = new Node(5);

        System.out.println("打印节点：");
        tree.printNodes(tree.root);

        System.out.println("\n二叉树的深度：" + tree.getDepth(tree.root));
    }
}