/**
* 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 flag = true;
int getHeight(TreeNode* root) {
if(!root) return 0;
int l_height = getHeight(root->left);
int r_height = getHeight(root->right);
if(abs(l_height - r_height) > 1) {
flag = false;
return 0;
}
return 1 + max(l_height, r_height);
}
bool isBalanced(TreeNode* root) {
if(!root) return true;
getHeight(root);
return flag;
}
};
【Leetcode Binary Tree C++】110. Balanced Binary Tree
Guess you like
Origin blog.csdn.net/m0_37454852/article/details/113575042
Recommended
Ranking