二叉排序树的实现

#include <iostream.h>
#include <malloc.h>
typedef struct BiTNode
{
int data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
bool 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);
}
bool InsertBST(BiTree &T,int e)
{
BiTree s,p;
if(!SearchBST(T,e,NULL,p))
{
s=(BiTree)malloc(sizeof(BiTNode));
s->data=e;
s->lchild=s->rchild=NULL;
if(!p) T=s;
else if(e<p->data) p->lchild=s;
else p->rchild=s;
return true;
}
else return false;
}
void MidOrder(BiTree T)
{
BiTree p;
p=T;
if(p==NULL) return;
else
{
MidOrder(p->lchild);
cout<<p->data<<"  ";
MidOrder(p->rchild);
}
}
bool Delete(BiTree &p)
{
BiTree q,s;
if(!p->rchild)
{
q=p;
p=p->lchild;
free(q);
}
else if(!p->lchild)
{
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;
delete s;
}
return true;
}
bool 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);
}
}
void main()
{
int i,data,m;
BiTree T=NULL;
cout<<"please input the mount the data you want to order:"<<endl;
cin>>m;
cout<<"please input the data:"<<endl;
for(i=0;i<m;i++)
{
cin>>data;
InsertBST(T,data);
}
MidOrder(T);
cout<<endl;
cout<<"please input the data you want to delete:"<<endl;
cin>>data;
DeleteBST(T,data);
MidOrder(T);
cout<<endl;
}