[LeetCode 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.

1、最简单的方法，判断每个节点左右子树的深度，算法时间复杂度网上有人计算是O（nlgn）。计算方法是统计一共重复遍历了多少个节点。

2、一开始有个地方转不过来，递归是进行判断，返回的是当前递归的真假值，如何将一次递归的真假值一直传递到最上层的调用中。方法是，将每次递归的返回值&&。

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