数据结构模拟试题(1)（Data structure simulation questions (1)）.docVIP

下载本文档

5
0
约1.01万字
约 14页
2017-08-02 发布于河南
举报
版权申诉

数据结构模拟试题(1)（Data structure simulation questions (1)）.doc

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

数据结构模拟试题(1)（Data structure simulation questions (1)） We only live once in the world, so we should cherish the time. You must live a real life and live a worthy life. - Pavlov Data structure simulation questions (1) First, fill in the blanks: 06 points, 02 points for each question 1, from a value equal to the X node searching with n nodes in a single list, in search of success, the average time is _______. 2, according to a set of records (56,42,50,64,48) in order to insert nodes to generate a AVL tree, when inserted into the value of _______ nodes need to adjust the rotation. 3, according to a set of records (56,74,63,64,48) in order to insert nodes to generate a AVL tree, when inserted into the value of 63 nodes need to adjust ________________. Radio question: 10 points, 02 points for each question 4, the time cost of an algorithm is T (n) =100n+10nlog2n+n2+10, and the time complexity is. A:O (n) B:O (nlog2n) C:O (N2) D:O (1) 5, in a sequential table of N in order to search for a value of X elements, in the case of equal probability, search success when the average number of comparisons is (). A:n B:n/2 C: (n+1) /2 D: (n-1) /2 In 6, a length n of the sequence table element number I (0 i n-1), need backwards () elements are moved forward. A:n-I B:n-I+1 C:n-i-1 D:I 7, do not take the lead node single linked list, first is empty, the decision condition is (). A:first = NULL; B:first-link = NULL; C:first-link = first; D:D. = NULL first; 8. The sum of the degrees of all nodes in a tree is equal to the sum of all nodes. A:0 B:1 C:1 D:2 9. The height of a completely two fork tree with 35 nodes. The height of the empty tree is assumed to be -1. A:5 B:6 C:7 D:8 10, for undirected graphs with e edges, there are () nodes in their adjacency tables. A:e-1 B:e C:2 (E-1) D:2e 11, graph depth first search, similar to the tree () order traversal. A: first root, B: middle root C: posterior root D: hierarchy 12, there is a graph with n vertices and e edges, and the adjacency table is