class Solution {
bool balanced=true;
int dfs(TreeNode* root) {
if(!root) return 0;
int l=dfs(root->left);
int r=dfs(root->right);
if(abs(l-r)>1) balanced=false;
return 1+max(l,r);
}
public:
bool isBalanced(TreeNode* root) {
dfs(root);
return balanced;
}
};
Leetcode110(力扣110):平衡二叉树
最新推荐文章于 2024-04-11 23:52:20 发布