110. 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.

Example 1:
Given the following tree [3,9,20,null,null,15,7]:
3
/ \
9 20
/ \
15 7
Return true.

Example 2:
Given the following tree [1,2,2,3,3,null,null,4,4]:
1
/ \
2 2
/ \
3 3
/ \
4 4
Return false.
方法一：自上向下（the top down approach)
平衡二叉树平均查找长度O(logN),对每个节点均需查找，总时间复杂度为O(NlogN)

/**
 * 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 {
    int Depth(TreeNode *root)
    {
        if(!root)
            return 0;
        return max(Depth(root->left),Depth(root->right))+1;
    }
public:
    bool isBalanced(TreeNode* root) {
        if(!root)
            return true;
        int lH=Depth(root->left);
        int rH=Depth(root->right);
        return abs(lH-rH)<=1 && isBalanced(root->left) && isBalanced(root->right);
    }
};

方法二：
自下而上

#define INBALANCE -1
class Solution {
public:
    bool isBalanced(TreeNode* root) {
        return dfs(root)!=INBALANCE;

    }
    int dfs(TreeNode *root)
    {
        if(!root)
            return 0;
        int lH=dfs(root->left);
        if(lH == INBALANCE)
            return INBALANCE;
        int rH=dfs(root->right);
        if(rH == INBALANCE)
            return INBALANCE;

        if(abs(lH-rH)>1)
            return INBALANCE;
        return max(lH,rH)+1;
    }

};