题目内容

7 The key sequence of a table with 10 records is (2, 15, 19, 25, 30, 34, 44, 55, 58, 80), use the binary search method to find the record with the key of 55, the number of comparisons is ().

A. 1 time
B. 2 timeS
C. 3 timeS
D. 4 timeS

查看答案

搜索结果不匹配？点我反馈

更多问题

8 By ( ) traversing the binary sort tree, we can get the non decreasing sequence of key values of each node.

A. inorder
B. level
C. postorder
D. preorder

9 Performing a sequential search on a sequence table with N elements, the average search length of successful search under equal probability is ( ).

A. (N+1)/2
B. N/2
C. N+1
D. N(N+1)/2

10 When binary searching for a linear table, a linear table ( ) is required.

A. B and C
B. orderly
C. sequentially stored
D. no correct answer

11 The sequential search method is suitable for linear tables with a storage structure of ( ).

A. sequential or chained storage
B. hash storage
C. compression storage
D. indexed storage