/**
* 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:
bool isBalanced(TreeNode* root) {
if(root==NULL) return true;
if((abs(depth(root->left)-depth(root->right))<=1)&&(isBalanced(root->left)&&isBalanced(root->right))){//如果根的左右子数高度相差《=1,并且左右子树都是平衡的。
return true;
}else return false;
}
int depth(TreeNode*root){
if(root==NULL) return 0;
else return 1+max(depth(root->left),depth(root->right));
}
};
LeetCode Balanced Binary Tree
最新推荐文章于 2020-06-24 10:01:33 发布