平衡二叉树判断_39

    public boolean IsBalanced_Solution(TreeNode root) {
        if (root==null){
            return true;
        }

        return Math.abs(treeDepth(root.left)-treeDepth(root.right))<=1?IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right):false;
    }


    //返回树深度
    private int treeDepth(TreeNode node) {
        if(node==null){
            return 0;
        }

        return Math.max(treeDepth(node.left),treeDepth(node.right))+1;
    }