Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Solution:
/**
* 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) {
bool res = true;
dfs(root, res);
return res;
}
int dfs(TreeNode *root, bool &res)
{
if(!root) return 0;
int left = dfs(root->left, res);
int right = dfs(root->right, res);
if(abs(left - right) > 1) res = false;
return max(left, right) + 1;
}
};