//判断二叉树是否为平衡二叉树:左树与右树的高度差<=1
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
class Balance {
public boolean isBalance(TreeNode root) {
if(root==null){
return true;
}else {
//左子树的最大深度
int leftHeight = maxDepth(root.left);
//右字数的最大深度
int rightHeight = maxDepth(root.right);
return Math.abs(leftHeight-rightHeight)<2&&isBalance(root.left)&&isBalance(root.right);
}
}
//计算根节点的最大深度
public int maxDepth(TreeNode root){
if(root==null){
return 0;
}
int leftHeight = maxDepth(root.left);
int rightHeight = maxDepth(root.right);
return leftHeight>rightHeight ? leftHeight+1:rightHeight+1;
}
}
平衡二叉树
最新推荐文章于 2022-06-19 14:07:08 发布