Note:
深搜找深度,每次搜左右子树深度以后都看看是不是满足平衡二叉树的条件,把ans定义成全局变量,遇到不符合的情况就直接给改掉
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool ans;
bool isBalanced(TreeNode* root) {
ans = true;
dfs(root);
return ans;
}
int dfs(TreeNode* root){
if(!root) return 0;
int lh = dfs(root -> left), rh = dfs(root -> right);
if(abs(lh - rh) > 1) ans = false;
return max(lh, rh) + 1;
}
};