#include<iostrem>
#include<algorithm>
#include<cstdlib>
using namespace std;
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 == NULL){
return true;
}
if(abs(height(root->left),height(root->right)) > 1){
return false;
}
return isBalanced(root->left)&&isBalanced(root->right);
}
public:
int height(TreeNode *root){
if(root == NULL){
return 0;
}
int left = height(root->left);
int right = height(root->right);
return max(left,right)+1;
}
};
leetcode110. Balanced Binary Tree
最新推荐文章于 2022-11-11 21:06:11 发布