数据结构填空题（Data structure fill in the blanks）.docVIP

数据结构填空题（Data structure fill in the blanks） 1. data structure is a subject that studies non numerical computing programming problems, the objects of computer operations and their relationships and operations. 2., data structures are formally defined as (D, R), where D is a finite set of data elements, and R is a finite set of relational sets on D. 3. data structure, including the logical structure of data, the storage structure of data and the operation of data, these three aspects. 4., data structures can be divided into two broad categories according to logical structure, they are linear structure and nonlinear structure. 5., there is a one to one relationship between elements in the linear structure. There is one to many relation among the elements in the tree structure, and there are many to many relations among the elements in the graph structure. 6. in the linear structure, the first node has no predecessor node, each node has only the rest 1 precursor node; the last node without subsequent nodes, each node has only the remaining 1 subsequent nodes. 7. in the tree structure, tree nodes without antecedent nodes, each node has a rest and only 1 precursor nodes; leaf nodes without subsequent nodes, subsequent nodes of each node can rest any number. 8. in the graph structure, the number of nodes and the number of subsequent nodes of each node can be arbitrarily many. 9. the storage structure of data can be represented by four basic storage methods, which are sequential, chained, indexed, and hashed. 10., the operation of the data, the most commonly used 5, They are inserted, deleted, modified, searched, and sorted. 11., the efficiency of an algorithm can be divided into time efficiency and space efficiency. 12. inserting or deleting an element in a sequence table requires averaging half of the elements in the table, and the number of specific moving elements is related to the length of the table and the location of the element in the table. 13. the set of nodes in