public class Solution {
public boolean IsBalanced_Solution(TreeNode root) {
return depth(root)>=0;
}
public int depth(TreeNode root){
if(root==null){
return 0;
}
int left=depth(root.left);
int right=depth(root.right);
if(left==-1||right==-1||Math.abs(left-right)>1){
return -1;
}else{
return Math.max(left,right)+1;
}
}
}
2021-12-04(JZ79 判断是不是平衡二叉树)
最新推荐文章于 2024-09-25 10:59:43 发布