数据结构选择题复习(Review of data structure selection questions).docVIP

  • 2
  • 0
  • 约1.05万字
  • 约 10页
  • 2017-10-07 发布于河南
  • 举报

数据结构选择题复习(Review of data structure selection questions).doc

数据结构选择题复习(Review of data structure selection questions)

数据结构选择题复习(Review of data structure selection questions) 1., the data logic structure includes three kinds of linear structure, tree structure and graph structure, and the tree structure and graph structure are called nonlinear structure. 2., the logical structure of data is divided into 4 sets: collection, linear structure, tree structure and graph structure. 3. 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. 4., 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. 5. in the tree structure, tree nodes without antecedent nodes, each node has a rest and only 1 precursor nodes; leaf nodes without subsequent nodes, each node can rest subsequent node any number. 6. basic storage methods for data structures are sequential, chained, indexed, and hashed storage. 7., to measure the merits of an algorithm mainly considers correctness, readability, robustness, time complexity and space complexity. 8. evaluate the merits of an algorithm, usually from two aspects of time complexity and space complexity. The 5 important characteristics of the 9. algorithm are the poor, deterministic, feasible, input and output. 10. move n-i elements forward when you delete the first I element in a sequential table of length n. 11. in a single linked list, to delete a designated node, you must find the nodes predecessor node. 12. in the doubly linked list, each node has two pointer domains, one points to the predecessor node and the other points to the successor node. 13. inserting or deleting a data element in a sequence table requires moving n data elements on average, with the number of moving data elements relevant to the location. 14. when the total number of element

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档