合肥工业大学数据结构试验七查找



包括完整的实验要求、实验预习报告、实验最终报告



实验要求：



<1> 对下列数据表，分别采用二分查找算法实现查找，给出查找过程依次所比较的元素（的下标），并以二分查找的判定树来解释。



<2> 设计出在二叉排序树中插入结点的算法，在此基础上实现构建二叉排序树的算法。



<3> 设计算法在二叉排序树中查找指定值的结点。



<4> 设计算法在二叉排序树中删除特定值的结点。



<5> 已知整型数组A[1..26]递增有序，设计算法以构造一棵平衡的二叉排序树来存放该数组中的所有元素。-Hefei University data structure test including seven Find complete experimental requirements prelab report, the experiment final report experimental requirements: < 1> , respectively, using a binary search algorithm to find the following data table, given the elements of the search process in turn comparison ( subscr ipt), and to explain the search decision tree. < 2>　design algorithm to insert a node in a binary sort tree, on this basis, build binary sort tree algorithm. < 3>　design algorithm to find the specified value in a binary sort tree node. < 4>　design algorithm to delete a specific value in the binary sort tree node. < 5>　known integer array A [1 .. 26] increasing order design algorithm to construct a balanced binary sort tree to store all of the elements in the array.