1、树的遍历及其变形
用后序遍历做得更好
bool IsBalanced(root)
if(root == NULL) return true
if(LastOrder(root) == -1) return false
return true
int LastOrder(root)//这里,LastOrder返回的所有值,-1是一种状态,其他的值都为树高度。因此,-1是需要传递的
if(root == NULL) return 0
left = LastOrder(root->left)
right = LastOrder(root->right)
if(left == -1||right == -1||abs(left-right) > 1) return -1
return max(LastOrder(root->left),LastOrder(root->right)) + 1