Balanced Binary Tree

Description:

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.

 

Code:

   int height( TreeNode * root )
    {
        if ( root == NULL )
            return 0;
        else
            return max( height( root->left ), height( root->right) ) + 1;
    }
    
    bool isBalanced(TreeNode* root) {
       if ( root == NULL )
        return true;
        
        if ( abs(height(root->left)-height(root->right)) > 1 )
            return false;
        else
            return isBalanced( root->left ) && isBalanced( root->right );
    }

 Code2：

class Solution {
public:
    bool isBalance(TreeNode* pRoot, int&height){
        if (pRoot == NULL){
             height = 0;
            return true;
        }
        bool isLeftBalance,isRightBalance;
        int leftH, rightH;
        isLeftBalance = isBalance(pRoot->left, leftH);
        isRightBalance = isBalance(pRoot->right, rightH);
        height = max(leftH, rightH)+1;
        if (isLeftBalance && isRightBalance && abs(leftH-rightH) <= 1)
            return true;
        return false;        
    }
    bool IsBalanced_Solution(TreeNode* pRoot) {
        int height;
        return isBalance(pRoot, height);
    }
};