1 In the case of randomly distributed of keywords, the search length of the binary sort tree method is on the order of magnitude of ( ）.
A. binary Search
B. sequential Search
C. blocking Search
D. hash Search
查看答案
2 About binary search,the following statement is correct ().
A. the tables to be looked up must be ordered and stored only in a sequential manner
B. the table to be looked up must be ordered ，and can be stored in a sequential or linked list
C. the table to be looked up must be ordered and the data in the table must be integer
D. the table to be looked up must be ordered and the data must be arranged from small to large
3 For an ordered table of 12 keywords, the average search length of the binary search is ( ).
A. 37/12
B. 25
C. 25/12
D. 10/12
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
微信支付 
支付宝支付