平衡二叉树

标签：lan   分享   img   技术分享   turn   his   binary   ges   blog   

/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/

class Solution {
public:
/*
* @param root: The root of binary tree.
* @return: True if this Binary tree is Balanced, or false.
*/
int depth(TreeNode *root) {
if (root == NULL) {
return 0;}
if (root->left== NULL && root->right == NULL) {
return 1;}
int lft = depth(root->left);
int rit = depth(root->right);
return max(lft , rit) + 1;
}
bool isBalanced(TreeNode *root) {
if (root == NULL) {
return 1;}
int lft = depth(root->left);
int rit = depth(root->right);
if (abs(lft-rit) <=1) {
return isBalanced(root->left)&&isBalanced(root->right);}
else
return 0;
}
};

平衡二叉树

标签：lan   分享   img   技术分享   turn   his   binary   ges   blog   

原文地址：http://www.cnblogs.com/ye-chen/p/7543259.html