balanced-binary-tree

1、链接：balanced-binary-tree来源：牛客网

Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

2、思路：如果溢出当前根节点的左右子树高度差大于1，则不满足要求；
3、代码：

public class Solution {
    private boolean isBal = true;
    public boolean isBalanced(TreeNode root){
        isBalan(root);
        return isBal;
    }
    private int isBalan(TreeNode root) {
        if(root == null)
            return 0;
        int left = isBalan(root.left);
        int right = isBalan(root.right);
        if(Math.abs(right -left) > 1){
            isBal = false;
        }
        return 1 + Math.max(left, right);
    }
}