题目内容

4 The binary sort tree is constructed with the following sequence respectively, which ( ) is different from the results constructed by the other three sequences .

A. （100，60， 80， 90， 120，110，130）
B. （100，80， 90， 60， 120，110，130）
C. （100，120，110，130，80， 60， 90）
D. （100，80， 60， 90， 120，130，110）

查看答案

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

更多问题

5 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

6 If the linear table can be found quickly and can adapt to dynamic changes, the ( ) search method can be used.

A. blocking Search
B. sequential Search
C. binary Search
D. attribute-based

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