求二叉树的深度（判断是否为平衡二叉树）

求二叉树的深度：递归，若树为空返回0，否则返回左子树和右子树深度较大者的深度+1

判断是否为平衡二叉树：求出左右子树的高度，判断它们的高度差是否超过1，再递归判断左子树和右子树

#include<iostream>
using namespace std;

struct TreeNode
{
	int val;
	TreeNode *left;
	TreeNode *right;
};

int TreeDepth(TreeNode* root)
{
	if (root == NULL)
	{
		return 0;
	}
	int left = TreeDepth(root->left);
	int right = TreeDepth(root->right);
	return (left > right) ? (left + 1) : (right + 1);
}

int IsBlancedTree(TreeNode* root)
{
	//是平衡二叉树返回1，不是返回0
	if (root == NULL)
		return 1;
	int left = TreeDepth(root->left);
	int right = TreeDepth(root->right);
	if ((right - left)!=0 && (right - left)!= 1 && (right - left) != -1)
	{
		return 0;
	}
	return IsBlancedTree(root->left) && IsBlancedTree(root->right);
}

TreeNode *creatTree(TreeNode* p, int k)
{
	p = (TreeNode*)malloc(sizeof(TreeNode));
	p->val = k;
	p->left = NULL;
	p->right = NULL;
	return p;
}

void removeTree(TreeNode *p)
{
	if (p == NULL)
	{
		return;
	}
	removeTree(p->left);
	removeTree(p->right);
	free(p);
}


int main()
{
	TreeNode *root = NULL;
	root = creatTree(root, 1);
	root->left = creatTree(root->left, 2);
	root->right = creatTree(root->right, 3);
	root->right->left = creatTree(root->right->left, 4);
	cout << TreeDepth(root) << endl;
	cout << IsBlancedTree(root) << endl;
	cout << "************" << endl;
	root->right->left->left = creatTree(root->right->left->left, 5);
	cout << TreeDepth(root) << endl;
	cout << IsBlancedTree(root) << endl;
	removeTree(root);
}