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.

解决思路：首先设计一个求二叉树高度的函数，然后调用该函数比较左右子树的高度差即可。

C++：

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

python:

# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    # @param root, a tree node
    # @return a boolean
    def height(self,root):
        if root == None:
            return 0
        hl = self.height(root.left)
        hr = self.height(root.right)
        if hl > hr:
            h = hl + 1
        else:
            h = hr + 1
        return h
    def isBalanced(self, root):
        if root == None:
            return True
        diff = self.height(root.left) - self.height(root.right)
        if diff > 1 or diff < -1:
            return False
        return self.isBalanced(root.left) and self.isBalanced(root.right)