class Solution {
public boolean isBalanced(TreeNode root) {
return getHeight(root) != -1;
}
private int getHeight(TreeNode root){
if(root == null){
return 0;
}
int leftHeight = getHeight(root.left);
if(leftHeight == -1){
return -1;
}
int rightHeight = getHeight(root.right);
if(rightHeight == -1){
return -1;
}
if(Math.abs(leftHeight -rightHeight) > 1){
return -1;
}
return Math.max(leftHeight,rightHeight) + 1;
}
}
代码随想录算法训练营第十七天 110.平衡二叉树
最新推荐文章于 2024-05-27 00:07:17 发布