Question
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
Difficulty:Easy
Category:Tree, Depth-First-Search
Analyze
Solution
class Solution {
public:
bool isBalanced(TreeNode* root) { return balanceHeight(root) >= 0; }
int balanceHeight(TreeNode* root) {
if (root == nullptr) return 0;
int left = balanceHeight(root->left);
int right = balanceHeight(root->right);
if (left < 0 || right < 0 || abs(left - right) > 1) return -1;
return max(left, right) + 1;
}
};