- 2
- 0
- 约1.05万字
- 约 10页
- 2017-10-07 发布于河南
- 举报
数据结构选择题复习(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
您可能关注的文档
- 战国城池(Warring States city).doc
- 我的国考经历(完整版)(My national exam experience (full version)).doc
- 战国时代,官职(Office in the Warring States Period).doc
- 战国烽烟起,摆酒论诸侯--地域品牌发展浅析(In the Warring States period, feast on regional brand development of princes).doc
- 战争之人苏联攻略(Man of war, Soviet Union).doc
- 战国策 卷十七 楚(四)(War state policy volume seventeen, Chu (four)).doc
- 战斗精灵合成公式(Combat sprite synthesis formula).doc
- 战国无双3(Sengoku musou3).doc
- 战棋游戏大全(Chess game).doc
- 战略与营销 无非 选择与集中(Strategy and marketing are nothing more than choice and concentration).doc
- 数控机床技术常用术语(Technical terms for numerical control machine tools).doc
- 数控课程设计总结(Numerical control curriculum design summary).doc
- 数控车床(中级)(CNC lathe (intermediate)).doc
- 数控车床编程入门知识(Introduction to CNC lathe programming).doc
- 数控车床编程入门(Introduction to NC lathe programming).doc
- 数控车床编程和机床注意事项(NC lathe programming and attention of machine tools).doc
- 数显电压表与电流表电表接线图(Connection diagram of digital voltmeter and ammeter).doc
- 数据结构课程1057(Data structure course 1057).doc
- 数格子和定位球的翻袋(A number of squares and set pieces).doc
- 数码宝贝日光金手指(Digital baby light gold finger).doc
最近下载
- DBJT_15-111-2016_预拌砂浆_生产与应用技术管理规程-全国各省建筑标准.pdf VIP
- DBJT_15-106-2015_顶管技术规程-全国各省建筑标准.pdf VIP
- 专题四 技术图样 考向一 错标、多标、漏标 学案(含解析)2025届高中通用技术.DOCX VIP
- (一模)南通市2026届高三学业质量监测语文试卷(含标准答案).doc VIP
- 专题四 技术图样 考向一 错标、多标、漏标 课件 2025届高中通用技术.pptx VIP
- 专题四 技术图样 考向四 三视图错误 学案(含解析)2025届高中通用技术.DOCX VIP
- 《七年级上册地理》重点精选ppt.pdf VIP
- 科技论文写作和文献检索公开课获奖课件.pptx VIP
- 专题四 技术图样 考向三 三视图选择 学案(含解析)2025届高中通用技术.DOCX VIP
- 专题四 技术图样 考向二 图样错误 学案(含解析)2025届高中通用技术.DOCX VIP
原创力文档

文档评论(0)