西电《数据结构》13春在线作业（West electricity data structure 13 spring online homework）.docVIP

下载本文档

3
0
约4.94千字
约 9页
2017-08-02 发布于河南
举报
版权申诉

西电《数据结构》13春在线作业（West electricity data structure 13 spring online homework）.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文档。上传文档

西电《数据结构》13春在线作业（West electricity data structure 13 spring online homework） 14 spring 13 autumn West Power data structure 13 spring online homework First, radio questions (10 questions, 40 points) 1., the leading link of the single linked list, head is empty, the decision condition is (). A. head==NULL B. head-next==NULL C. head-next==head D. head! =NULL! 2. has six elements, 6, 5, 4, 3, 2, 1 in the order of the stack, which of the following is not a legitimate stack sequence? () A. 543612 B. 453261 C. 346521 D. 234156 3., the efficiency of performing () operations in a list is more efficient than in a sequential table. A. dichotomy search B. quick search C. sequential lookup D. insertion The 4. stack is used in (). A. recursive call B. subroutine call C. expression evaluation D., A, B, C 5., in accordance with the definition of two fork tree, with 3 nodes of the two fork tree, there are () different tree species. A. 3 B. 4 C. 5 D. 6 6. for linear tables stored sequentially, the time complexity of accessing nodes and deleting nodes is (). A. O (n) O (n) B. O (n) O (1) C. O (1) O (n) D. O (1) O (1) 7., compared with single linked lists, one of the advantages of double linked lists is that. A. insert and delete operations are simpler B. can be accessed randomly C. can omit head or footer pointers D. access to adjacent nodes is more flexible 8. insert the new node *s before the *p node of the bidirectional linked list. A. p-prior=s; s-next=p; p-prior-next=s; s-prior=p-prior; B. p-prior=s; p-prior-next=s; s-next=p; s-prior=p-prior; C. s-next=p; s-prior=p-prior; p-prior=s; p-prior-next=s; D. s-next=p; s-prior=p-prior; p-prior-next=s; p-prior=s; 9. if an array of size 6 to achieve circular queue, and the rear and front values were 0 and 3, when an element is deleted from the queue, adding two elements, rear and front respectively? () A. 1 and 5 B. 2 and 4 C. 4 and 2 D. 5 and 1 10. in the following operations, () is the basic operation of an array. A. insertion B. delete C.