设哈希表的长度m=11,哈希函数为H(K)=K mod m,采用链地址法解决冲突,待依次插入的关键码序列为{1,13,12,34,38,33,27,22}。根据构成的哈希表:在等概率的情况下,搜索成功时的平均查找长度为 ,在等概率的情况下,搜索失败时的平均查找长度为 。
查看答案
已知一个有序表{15,26,34,39,45,56,58,63,74,76,83,94}顺序存储于一维数组a[12]中,根据折半查找过程,查找34、56、58、63、94的比较次数分别为、、、、。
向一棵二叉排序树中插入一个新结点,则该结点一定为叶子结点。
A. 对
B. 错
能够在链接存储的有序表上进行折半搜索,其时间复杂度与在顺序存储的有序表上相同。
A. 对
B. 错
Why are there more than 40 words for camel in Arabic regions?
A. Because there are many kinds of camel in Arabic regions.
Because people like camel so much in Arabic regions.
C. Because camel has many connotations in Arabic regions.
D. Because camel plays significant role in people's life.