二叉树的深度&判断是否为平衡二叉树（Java实现）

public class E55TreeDepth {
    //二叉树的深度

    /*问题一：二叉树的最长路径*/
    public static int getTreeDepth(BinaryTreeNode root) {
        if (root == null)
            return 0;
        int left = getTreeDepth(root.left);
        int right = getTreeDepth(root.right);
        return (left > right ? left + 1 : right + 1);
    }

    /*问题二：判断是否为平衡二叉树，即是否任意节点的左右子树高差都不大于1*/
    public static boolean isBalanceTree(BinaryTreeNode root) {
        if (root == null)
            return false;
        Depth depth = new Depth();
        return isBalanceTree(root, depth);
    }
    //用于保存深度数值
    private static class Depth {
        int value;
        Depth(){
            value = 0;
        }
    }

    private static boolean isBalanceTree(BinaryTreeNode root, Depth depth) {
        if (root == null) {
             depth.value = 0;
            return true;
        }
        Depth left = new Depth();
        Depth right = new Depth();
        if (isBalanceTree(root.left, left) && isBalanceTree(root.right, right)) {
            int distance = left.value - right.value;
            if (distance <= 1 && distance >= -1) {
                depth.value = (left.value > right.value) ? left.value + 1 : right.value + 1;
                return true;
            }
        }
        return false;
    }
}