数据结构(c语言版)复习资料(Data structure (C Language Edition) review information).docVIP

数据结构(c语言版)复习资料(Data structure (C Language Edition) review information).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
数据结构(c语言版)复习资料(Data structure (C Language Edition) review information)

数据结构(c语言版)复习资料(Data structure (C Language Edition) review information) Do not think that it is confused; do not seek, so no more; dont ask, so I do not know. Review the information data structure First, fill in the blanks The data structure of the 1. is a research of non computer numerical calculation program design problems in the operation of the objects and their relationships and operations such as discipline The 2. form of data structure is defined as (D R) Where D is a finite set of data elements R is a finite set of relations on D 3. data structure including logic structure, storage structure and data operation data of these three aspects 4. data structure according to the logical structure can be divided into two categories. They are the linear structure and nonlinear structure. Between the 5. elements of the linear structure in a one-to-one relationship There is a one to many relationships between the elements in the tree structure There are many to many relationships between the elements in the graph structure 6. in linear structure The first node has no predecessor node The rest of each node and only 1 precursor node; the last node has no subsequent node The rest of each node has only 1 subsequent nodes 7. in tree structure The root node has no predecessor node The rest of each node and only 1 precursor nodes; leaf nodes without subsequent nodes The following nodes for each of the remaining nodes can be any more 8. in a graph structure The precursor of nodes and subsequent nodes of each node can be any more 9. data storage structure available four basic storage method They are order, chain, indexing and hashing 10. data operations are the most commonly used 5 They are inserted, delete, search, sorting 11. the efficiency of an algorithm can be divided into time and space efficiency 12. the table in order to insert or delete an element Half the average mobile elements in the table The mobile number of elements with a long table and the position of the eleme

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档