二叉树平衡检查

struct TreeNode {
int val;
char data;
struct TreeNode *left;
struct TreeNode *right;
// TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Balance {
public:
void createBiTree(TreeNode *T)
{
char c;
cin >> c;
if('#' == c)
T = NULL;
else
{
T =new TreeNode();
T->data = c;
createBiTree(T->left);
createBiTree(T->right);
}
}
int deep(TreeNode * T)
{
if(T==NULL) return 0;
int left = deep(T->left);
int right = deep(T->right);
return left>right?left+1:right+1;
}

bool isBalance(TreeNode* root) {
// write code here
if (root==NULL)
{
return true;
}
int left=deep(root->left);
int right= deep(root->right);
if (abs(left-right)>1)
{
return false;
}else
{
return isBalance(root->left)&&isBalance(root->right);	// 返回左子树和右子树的深度之差
}
}
};
void  main()
{
Balance A;
TreeNode *T=NULL;
A.createBiTree(T);
cout<<A.isBalance(T)<<endl;
}