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.

#include<iostream>
#include<cmath>

/**
 * 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) return true;
        if(abs( height(root->left)-height(root->right))<2 && isBalanced(root->left) && isBalanced(root->right)) 
            return true;
        return false;
    }
    
    int height(TreeNode *root){
		if (!root) return 0;
		else {
			int lchild = height(root->left);
			int	rchild = height(root->right);
			return ((lchild > rchild)?lchild:rchild)+1;
		}
	}
};

LeetCode之Balanced Binary Tree,布布扣,bubuko.com

LeetCode之Balanced Binary Tree

原文：http://blog.csdn.net/smileteo/article/details/21640523