题目描述
输入一棵二叉树,判断该二叉树是否是平衡二叉树。
import java.util.*;
public class Solution {
public boolean IsBalanced_Solution(TreeNode root) {
if(root == null) return true;
int left = getHight(root.left);
int right = getHight(root.right);
if(Math.abs(left - right) > 1)
return false;
return true;
}
public int getHight(TreeNode root){
if(root == null)
return 0;
int leftHight = getHight(root.left);//左⼦子树⾼高度
int rightHight=getHight(root.right);//右⼦子树⾼高度
return (leftHight > rightHight) ? (leftHight+1) : (rightHight+1);
}
}