题解 | #判断是不是平衡二叉树#

public class Solution {
    public boolean IsBalanced_Solution(TreeNode root) {
        if(root == null) return true;
        if(Math.abs(getDeep(root.left) - getDeep(root.right)) > 1)
                return false;
        return IsBalanced_Solution(root.left) && IsBalanced_Solution(root.right)?true:false;
    }
    //计算当前节点的最大深度
    public static int getDeep(TreeNode root){
        if(root == null) return 0;
        return Math.max(getDeep(root.left)+1,getDeep(root.right)+1);
    }
}