LeetCode OJ:Balanced Binary Tree

Balanced Binary Tree

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 binary tree
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int dfsdepth(TreeNode *root){
if(root==NULL)return 0;
int depl=dfsdepth(root->left);
int depr=dfsdepth(root->right);
if(fabs(depl-depr)>1)return INT_MAX>>2;
return max(depl,depr)+1;
}
bool isBalanced(TreeNode *root) {
if(dfsdepth(root)>=INT_MAX>>2)return false;
return true;
}
};