typedef struct {//数据元素类型定义
KeyType key;//关键字域
... //其他域
}ElemType;
typedef struct { //顺序表结构类型定义
ElemType *R; //表基址
int length; //表长
}SSTable; //Sequential Search Table
SSTable ST; //定义顺序表ST
int Search_Seq( SSTable ST , KeyType key ){//若成功返回其位置信息，否则返回0
for( i=ST.length; i>=1; --i )
if ( ST.R[ i ].key==key ) return i;
return o;
}
int Search_Seq(SSTable ST,KeyType key) {
for (i = ST.length ; ST.R[i].key != key ; --i )
if ( i <= 0) break ;
if (i > 0) return i ;
else return 0 ;
}
int Search_Seq(SSTable ST,KeyType key){
for (i = ST.length ; ST.R[i].key != key && i>0 ; --i );
if (i > 0) return i;
else return 0 ;
}
int Search_Seq( SSTable ST , KeyType key ){
ST.R[O].key =key;
for( i=ST.length; ST.R[i].key!=key; --i)
return i;
}
int Search_Bin ( SSTable ST,KeyType key ) {
low = 1 ; high = ST.length ; //置区间初值
while (low <= high) {
mid = (low + high)/ 2 ;
if (ST.R[mid].key == key)
return mid ; //找到待查元素
else if (key <ST.R[mid].key) //缩小查找区间
high=mid-1; //继续在前半区间查找
else low = mid + 1; //继续在后半区间查找
}
return 0 ; //顺序表中不存在待查元素
}// Search_Bin
int Search_Bin (SSTable ST, keyType key, int low, int high) {
if(low>high)
return 0; //查找不到时返回0
mid=(low+high)/2;
if(key==ST.elem[mid].key)
return mid;
else if(key<ST.elem[mid].key)
Search_Bin(ST,key,low,mid);
else
Search_Bin(ST,key,mid,high);
}
typedef struct {
KeyType key; //关键字项
InfoType otherinfo;//其他数据域
}ElemType;
typedef struct BSTNode {
ElemType data; //数据域
struct BSTNode *lchild，*rchild; //左右孩子指针
}BSTNode，*BSTree;
BSTree T;//定义二叉排序树T
BSTree SearchBST(BSTree T,KeyType key) {
if((T) || key==T->data.key) return T;
else if (key<T->data.key)
return SearchBST(T->Ichild,key);//在左子树中继续查找
else
return SearchBST(T->rchild,key);//在右子树中继续查找
}// SearchBST
存中…(img-3YYHv8O1-1642651437063)]
[外链图片转存中…(img-xJkp7FIE-1642651437063)]
[外链图片转存中…(img-jdamQ6od-1642651437063)]
[外链图片转存中…(img-OiZ0F4JV-1642651437064)]