//判定二叉树是不是平衡二叉树
//网上的版本要不断的重复计算
//返回-1,以x为头的子树不是平衡二叉树
//否则返回值是 子树的深度
int BalantTree(Node *x)
{
if(x ==NULL)
return 0;
int right = BalantTree(x.right);
int left = BalantTree(x.left);
if(right<0 || left<0)
return -1;
if(abs(right - left)>1)
return -1;
return 1+((right>left)?right:left);
}
网上的版本
- template<typename T>
- int DepthTree(BSTreeNode<T> *pbs)
- {
- if (pbs==NULL)
- return 0;
- else
- {
- int leftLength=DepthTree(pbs->left);
- int rigthLength=DepthTree(pbs->right);
- return 1+(leftLength>rigthLength ? leftLength:rigthLength);
- }
- }
- template<typename T>
- bool isBalanceTree(BSTreeNode<T> *pbs)
- {
- if (pbs==NULL)
- {
- return true;
- }
- int depthLeft=DepthTree(pbs->left);
- int depthRight=DepthTree(pbs->right);
- if (abs(depthLeft-depthRight)>1)
- return false;
- else
- return isBalanceTree(pbs->left) && isBalanceTree(pbs->right);
- }