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.
/**
* 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) {
if(root == NULL){
return true;
}
int depthOfLeft = getDepth(root->left, 1);
int depthOfRight = getDepth(root->right, 1);
if(abs(depthOfRight-depthOfLeft) > 1){
return false;
}else{
return isBalanced(root->left) && isBalanced(root->right);
}
}
//获取二叉树的深度
int getDepth(TreeNode* tree, int currentDepth){
if(tree == NULL){
return currentDepth;
}
return max(getDepth(tree->left, currentDepth+1), getDepth(tree->right, currentDepth+1));
}
};