/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode *root)
{
if(!root) return true;
if(abs(height(root->left)-height(root->right))>=2)
{
return false;
}
return isBalanced(root->left)&&isBalanced(root->right);
}
int height(TreeNode *root)
{
if(!root) return 0;
int leftH=height(root->left);
int rightH=height(root->right);
return (leftH>rightH)?(leftH+1):(rightH+1);
}
};
Balanced Binary Tree
最新推荐文章于 2020-12-18 14:21:59 发布