/**
* 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(helper(root)==-1)
return false;
return true;
}
int helper(TreeNode* root)
{
if(!root)
return 0;
int dl=helper(root->left);
if(dl==-1)
return -1;
int dr=helper(root->right);
if(dr==-1)
return -1;
if(abs(dl-dr)>1)
return -1;
return max(dl+1,dr+1);
}
};
leetcode 110: Balanced Binary Tree
最新推荐文章于 2024-04-11 23:52:20 发布