线性表的折半查找
线性表的存储结构#define MAXL 10
typedef int KeyType;
typedef int InfoType;
struct RecType {
KeyType key;
InfoType data;
树表的查找
BST:Binary Sort Tree，二叉排序树p=malloc(...)强制类型转换→p=(BSTNode *)malloc(...)二叉排序树的存储结构typedef int KeyType;
typedef int InfoTyp