数据结构实验 查找(5)

}

*f=p;

p->lchild=q->lchild;

if(s!=p)

{

s->lchild=p->rchild;

p->rchild=q->rchild;

}

}

}

free(q);

flag=1;

}

return flag;

}

void InOrder(NodeType *bt)

{

if(bt==NULL) return;

InOrder(bt->lchild);

printf("%3d",bt->data);

InOrder(bt->rchild);

}

/*折半查找*/

int Binary_Search(S_TBL *tbl,int kx)

{

int low,high,mid,flag;

flag=0;

low=1;

high=tbl->length;

while(low<=high)

{

mid=(low+high)/2;

if(kx<tbl->data[mid].num)

{

high=mid-1;

}

elseif(kx>tbl->data[mid].num)

{

low=mid+1;

}

else

{

flag=mid; break;