输入一棵二叉树，判断该二叉树是否是平衡二叉树。

题目描述

/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
bool IsBalanced_Solution(TreeNode* pRoot) {
if(!pRoot) return true;
int ldepth=0,rdepth=0;
Depth(pRoot->left,1,ldepth);
Depth(pRoot->right,1,rdepth);
if(max(ldepth,rdepth)-min(ldepth,rdepth)>1) return false;
return IsBalanced_Solution(pRoot->left)&&IsBalanced_Solution(pRoot->right);
}
void Depth(TreeNode *root,int depth,int &max){
if(!root) return;
Depth(root->left,depth+1,max);
if(depth>max) max=depth;
Depth(root->right,depth+1,max);
}
};