查找的一些函数

1、二叉排序树的查找

#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
typedef struct BSTNode
{
	ElemType data;
	struct BSTNode  *lchild,*rchild;
}BSTNode,*BSTree;
BSTree CreateBST();/ *二叉排序树创建，由裁判实现，细节不表* /
BSTree SearchBST(BSTree T,ElemType e);
int main()
{
	BSTree T,result;
	ElemType n,e;
	T = CreateBST();
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&e);
		result = SearchBST(T,e);
		if(result) printf("%d is found\n",result->data);
		else printf("%d is not found\n",e);
	}
	return 0;
}
BSTree SearchBST(BSTree T,ElemType e)
{
	if(!T||e==T->data) return T;
	if(e<T->data) return SearchBST(T->lchild,e);
	else return SearchBST(T->rchild,e);
}

2、折半查找的递归查找操作

#include <stdio.h>
#include <stdlib.h>
typedef int KeyType;
typedef struct {
          KeyType   *data; /*表基址*/
          int     length;      /*表长