leetcode: 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:
    bool isBalanced(TreeNode *root) {
        if( root == NULL)
            return true;
        if( abs( depth(root->left) - depth(root->right)) <= 1)
            return isBalanced( root->left) && isBalanced( root->right);
        else
            return false;
    }
    int depth( TreeNode * root){
        if( root == NULL)
            return 0;
        if( root->left && root->right)
            return max( depth(root->left) + 1, depth( root->right) + 1);
        else if( root->left)
            return depth( root->left) + 1;
        else if( root->right)
            return depth( root->right) + 1;
        else
            return 1;
    }
};

更快，更优雅的解法

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