数据结构实验 查找(3)
时间:2025-07-08
时间:2025-07-08
{
if(kx>(*q)->data)
{
*p=*q;
*q=(*q)->rchild;
}
else
{
if(kx<(*q)->data)
{
*p=*q;
*q=(*q)->lchild;
}
else
{
flag=1;
break;
}
}
}
return flag;
}
int InsertNode(NodeType **T,int kx)
{
int flag=0;
NodeType *p=*T,*q,*s;
if(!SearchData(*T,&p,&q,kx))
{
s=(NodeType*)malloc(sizeof(NodeType));
s->data=kx;
s->lchild=NULL;
s->rchild=NULL;
if(p==NULL)
{
*T=s;
}
else
{
if(kx>p->data)
{
p->rchild=s;
}
else