数据结构习题(国外英语资料).docVIP

数据结构习题 The ideal of many people is to change the world, but few people are willing to change themselves. The second chapter linear table A judge. (each of the following questions, please tick the right in front of the brackets; the wrong play x) () (1) the chain storage structure of linear table is better than sequential storage. () (2) each node of a list contains exactly one pointer field. (3) in a chained storage structure of a linear table, the two elements logically adjacent are not necessarily adjacent to the physical location. () (4) the advantage of sequential storage is that the storage density is large and the insertion and deletion efficiency is high. () (5) the deletion algorithm of the linear list is simple, because when a node in the chain is deleted, the computer automatically moves the subsequent units forward. () (6) each node of a sequential table can only be a simple type, and each node of the list can be a complex type. ((7)) of the linear table chain storage can be used an arbitrary storage unit stores the data in the table element. () (8) linear tables are sequentially stored and must take up a contiguous memory cell. () (9) the sequential table structure is suitable for sequential access, while the linked list is suitable for random access. () (10) insert and delete operations are the two most basic operations in a data structure, so these two operations are also frequently used in arrays. Two. Fill in the blanks (1) logically adjacent elements in a sequence table are connected at physical locations. (yes, necessary, unable, etc) (2) the set of nodes in a linear table is finite, and the relation between nodes is a relation. (3) the advantages of the sequential table relative to the list are: and random access. (4) the advantages of the list relative to the sequential table are: convenience. (5) the linear table with storage structure is called order table. (6) the time complexity of accessing any node in a sequential table is. (7) the advantag