题目描述:
输入一棵二叉树,判断该二叉树是否是平衡二叉树。
在这里,我们只需要考虑其平衡性,不需要考虑其是不是排序二叉树
参考代码:
public boolean IsBalanced_Solution(TreeNode root) {
if(root == null)return true;
return judge(root) != -1;
}
public int judge(TreeNode root){
if(root == null)return 0;
int left = judge(root.left);
if(left == -1)return -1;
int right = judge(root.right);
if(right == -1)return -1;
return Math.abs(left - right) > 1 ? -1 : Math.max(left, right) + 1;
}