思路:在计算二叉树高度的同时,判断左右子树的高度差是否小于等于1
一边遍历树一边判断每个结点是否具有平衡性
bool IsBalanced(TreeNode *root, int & dep) {
if (root == NULL) {
return true;
}
int left = 0;
int right = 0;
if (IsBalanced(root->left, left) && IsBalanced(root->right, right)) {
int dif = left - right;
if (dif<-1 || dif >1)
return false;
dep = (left > right ? left : right) + 1;
return true;
}
return false;
}
bool IsBalanced_Solution(TreeNode* pRoot) {
int dep = 0;
return IsBalanced(pRoot, dep);