剑指Offer(牛客网)-平衡二叉树

题目来源：

https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=2&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述：

输入一棵二叉树，判断该二叉树是否是平衡二叉树。

代码如下：

public class Solution {
    public boolean IsBalanced_Solution(TreeNode root) {
        //返回-1说明不平衡
        return isBalance(root) != -1;
    }
    private int isBalance(TreeNode root) {
        if (root == null) return 0;
        int left = isBalance(root.left);
        //如果左子树不平衡直接返回
        if (left == -1) return -1;
        int right = isBalance(root.right);
        //如果右子树不平衡直接返回
        if (right == -1) return -1;
        //左右子树都平衡，判断该root结点的树是否平衡
        return Math.abs(left - right) > 1 ? -1 : 1 + Math.max(left, right);
    }
}