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

import java.util.*;
public class Solution {
    public int treeHeight (TreeNode pRoot) {
        return pRoot==null?0:treeHeight(pRoot.left)>treeHeight(pRoot.right)?treeHeight(pRoot.left)+1:treeHeight(pRoot.right)+1;
    }
    public boolean IsBalanced_Solution (TreeNode pRoot) {
        if(pRoot==null) return true;
        return Math.abs(treeHeight(pRoot.left)-treeHeight(pRoot.right))>1?false:
        (IsBalanced_Solution(pRoot.left)&&IsBalanced_Solution(pRoot.right));
    }
}

没人看得懂