数据结构课程资料35（Data structure course information 35）.docVIP

下载本文档

4
0
约1.43万字
约 27页
2017-08-02 发布于河南
举报
版权申诉

数据结构课程资料35（Data structure course information 35）.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文档。上传文档

数据结构课程资料35（Data structure course information 35） 1, ask Confucius Bright as is fond of studying.. Data structure course information A RadioButtonList (every day, 2 points, 20 points) 1. in a linear table stored in the order of N, the time complexity of inserting an element is () A., O (n), B., O (n/2), C., O (1), D., O (N2) 2. in a linear sequence table storage length N, remove the I elements (0 i n-1), need backwards () elements are moved forward A., n-i, B., n-i+1, C., n-i-1, D., I 3., the number of nodes in a generalized table is n, and the time complexity of the generalized table depth algorithm is ( A., O (1), B., O (n), C., O (N2), D., O (log2n) 4. assume that the queue header and team tail pointer of a sequential queue are f and R, respectively, and the condition of the team is null A., f+1==r, B., r+1==f, C., f==0, D., f==r 5. in the cyclic single chain table, which is indicated by the pointer F, the judgment condition that contains only one node is () A. f-next==NULL; B. f==NULL; C. f-next==f; D. f-next; =f; In 6. a two binary tree of two binary list, null pointer domain is equal to the number of nodes (plus) A. 2, B. 1, C. 0, D. -1 7. when searching an element from a two fork search tree, the time complexity is roughly A., O (n), B., O (1), C., O (log2n), D., O (N2) 8. in a 5 - order B tree, the root node allows at most () a keyword A. 1, B. 2, C. 3, D. 4 The decision tree corresponding to the 9. two search process, is a ideal balanced tree, is a tree ____________ A. general two fork tree, B. two fork search tree, C. full two fork tree, D. completely two fork tree 10., in the direct selection of n elements, you need to make () select and exchange A., n-1, B., N, C., n+1, D., n/2 Two, fill in the blanks (2 points per day, a total of 20 points) __________ structure is divided into 1. data sequence, links, indexing and hashing structure four 2. for a length of n single link storage linear tables, insert nodes in the header and the time complexity is ________