1．利用实验一建立的有序表，采用折半查找实现对某一已知的关键字的查找。

2．随机产生一组关键字，利用二叉排序树的插入算法建立二叉排序树，然后删除某一指定关键字元素。

3．已知散列函数为H(key)=key p（p为自定义的常数），冲突处理方法分别为线性探测法和外拉链法，建立散列表并实现查找某一指定关键字元素。-1. Experiment established orderly table, using a binary search to achieve a known keyword search. 2. Randomly generated a set of keywords, binary sort tree insertion the build binary sort tree algorithm, and then delete a specified keyword elements. 3. Known hash function H (key) = key　p (p is a constant custom) conflict handling methods were linear detection method and outside zipper method, set up the hash table and Find a designated keyword element.