class Solution {
public:
int high(TreeNode* root){
if(!root)return 0;
int l=high(root->left);
int r=high(root->right);
return 1+(l>r?l:r);
}
bool isBalanced(TreeNode* root) {
if(!root)return true;
if(abs(high(root->left)-high(root->right))>1)return false;
return isBalanced(root->left) && isBalanced(root->right);
}
};
力扣110. 平衡二叉树C++
最新推荐文章于 2023-10-08 08:00:00 发布