ACM模版
二叉排序树
typedef bool Status;
typedef struct BiTNode
{
int data;
struct BiTNode *lchild, *rchild;
} BiTNode, *BiTree;
Status SearchBST(BiTree T, int Key, BiTree f, BiTree *p)
{
if (!T)
{
*p = f;
return false;
}
else if (Key == T->data)
{
*p = T;
return true;
}
else if (Key < T->data)
{
return SearchBST(T->lchild, Key, T, p);
}
else
{
return SearchBST(T->rchild, Key, T, p);
}
}
Status InserBST(BiTree *T, int Key)
{
BiTree p, s;
if (!SearchBST(*T, Key, NULL, &p))
{
s = (BiTree)malloc(sizeof(BiTNode));
s->data = Key;
s->lchild = s->rchild = NULL;
if (!p)
{
*T = s;
}
else if (Key < p->data)
{
p->lchild = s;
}
else
{
p->rchild = s;
}
return true;
}
else
{
return false;
}
}
Status Delete(BiTree *p)
{
BiTree q, s;
if ((*p)->rchild == NULL)
{
q = *p;
(*p) = (*p)->lchild;
free(q);
}
else if ((*p)->lchild == NULL)
{
q = *p;
(*p) = (*p)->rchild;
free(q);
}
else
{
q = *p;
s = (*p)->lchild;
while (s->rchild)
{
q = s;
s = s->rchild;
}
(*p)->data = s->data;
if (q != *p)
{
q->rchild = s->lchild;
}
else
{
q->lchild = s->lchild;
}
free(s);
}
return true;
}
Status DeleteBST(BiTree *T, int Key)
{
if (!*T)
{
return false;
}
else
{
if (Key == (*T)->data)
{
return Delete(T);
}
else if (Key < (*T)->data)
{
return DeleteBST(&(*T)->lchild, Key);
}
else
{
return DeleteBST(&(*T)->rchild, Key);
}
}
}