题目链接:https://www.acwing.com/problem/content/68/
题目如下:
/**
* 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) {
res=true;
dfs(root);
return res;
}
int dfs(TreeNode* root){
if(!root) return 0;
if(res==false) return 0;//提前终止递归
int leftdep=dfs(root->left);
int rightdep=dfs(root->right);
if(abs(leftdep-rightdep)>1) res=false;
return max(leftdep,rightdep)+1;
}
private:
bool res;
};