题目
题解
非递归
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int depth(TreeNode* root){
if(root == NULL)
return 0;
int left = depth(root->left);
int right = depth(root->right);
return left > right ? left + 1 : right + 1;
}
bool isBalanced(TreeNode* root) {
if(root == NULL)
return true;
vector<TreeNode *> vec;
vec.push_back(root);
while(!vec.empty()){
vector<TreeNode*> temp;
for(int i=0;i<vec.size();i++){
int left = depth(vec[i]->left);
int right = depth(vec[i]->right);
if(abs(left - right)>1)
return false;
else{
if(vec[i]->left != NULL)
temp.push_back(vec[i]->left);
if(vec[i]->right != NULL)
temp.push_back(vec[i]->right);
}
}
vec = temp;
}
return true;
}
};
递归
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int depth(TreeNode* root){
if(root == NULL)
return 0;
int left = depth(root->left);
int right = depth(root->right);
return left > right ? left + 1 : right + 1;
}
bool isBalanced(TreeNode* root) {
if(root == NULL)
return true;
bool left = isBalanced(root->left);
bool right = isBalanced(root->right);
if(left && right){
if(abs(depth(root->left) - depth(root->right)) <=1)
return true;
}
return false;
}
};