Tree:二叉树深度

public static int test4(BinTreeNode node) {
        if (node == null) {
            return 0;
        } else {
            return 1+Math.max(test4(node.left), test4(node.right));
        }
        
    }