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.
Example 1:
Given the following tree [3,9,20,null,null,15,7]
:
3 / \ 9 20 / \ 15 7
Return true.
Example 2:
Given the following tree [1,2,2,3,3,null,null,4,4]
:
1 / \ 2 2 / \ 3 3 / \ 4 4
Return false.
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int checkBST(TreeNode* root, bool& ret){
if(!root) return 0;
int leftH = checkBST(root->left, ret);//左子树高
if(!ret)
return leftH;
int rightH = checkBST(root->right, ret);//右子树高
if(abs(leftH - rightH) > 1){
ret = false;
return rightH;
}
return max(leftH, rightH) + 1;//root高度
}
bool isBalanced(TreeNode* root) {
bool ret = true;
checkBST(root, ret);
return ret;
}