15. Breadth-first traversal is similar to binary tree ().
A. Preorder traversal
B. In-order traversal
C. Post-order traversal
D. Traversal
查看答案
16. In the representation of a graph, only has one representation is ().
Adjacency matrix representation
B. Adjacency list representation
C. Reverse adjacency list representation
D. Adjacency list and inverse adjacency list representation
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
微信支付 
支付宝支付