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.
使用DPS加入判断-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;
else
return (finddeep(root)!=-1);
}
private:
int finddeep(TreeNode *root)
{
if(root==NULL)
return 0;
int leftdeep=finddeep(root->left);
int rightdeep=finddeep(root->right);
if(leftdeep==-1||rightdeep==-1||abs(leftdeep-rightdeep)>1)
return -1;
return (leftdeep>rightdeep?leftdeep+1:rightdeep+1);
}
};