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 ofevery node never differ by more than 1.
bool isBalanced(TreeNode *root) {
if (root == NULL)
return true;
if (abs(getDepth(root->left) - getDepth(root->right)) > 1)
return false;
return isBalanced(root->left) && isBalanced(root->right);
}
int getDepth(TreeNode *root){
if (root == NULL)
return 0;
return max(getDepth(root->left), getDepth(root->right)) + 1;
}