数据结构实验一答案（Data structure experiment one answer）.docVIP

下载本文档

6
0
约6.74千字
约 24页
2017-08-02 发布于河南
举报
版权申诉

数据结构实验一答案（Data structure experiment one answer）.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文档。上传文档

数据结构实验一答案（Data structure experiment one answer） [problem description] Linear table is a typical linear structure, the realization of ADT List, and on this basis to achieve the two sets of delivery, arithmetic or parallel operations. [experimental purposes] (1) grasp two storage structures of linear table, which are sequential table and linked list. (2) master the basic operation of the sequential table and single linked list. (3) in order to master the basic operation of the sequential table and single linked list, the implementation of comprehensive questions. [contents and requirements] (1) the elements of a collection are defined as decimal numbers. (2) enter any of the two sets of elements at will. (3) display the contents of two sets and their operation results. (4) requires the realization of linked list. [test data] (1) set1={3, 5, 8, 11}, set2={2, 6, 8, 9,, 11, 15, 20} Set1, set2 =? Set1 set2 =? (2) set1={9, 3, 14, 6}, set2={1, 30, 3, 7, 14,, 25, 6, 19, 3, 9} Set1, set2 =? Set1 set2=? #include iostream Using namespace std; Class List; The definition of class ListNode / node class { Friend class List; / / statement for the friends of the staff Private: Double data; ListNode *link; Public: (ListNode): link (NULL) {} ListNode (const double item): data (item), link (NULL) {} }; The definition of a single list of List / / class {private: ListNode, *first, *current; Public: List () {first=current=new ListNode;} ~List () {MakeEmpty (); delete first;} Void, MakeEmpty (); ListNode, *Firster () {current=first; return first;} Int Find (double value); Int append (double value); Int (Remove); / / delete the current element Double (First); / / take the current pointer to the first element Double (Next); / / returns the next element of the current element Void, print (); ListNode *getNode (double, item, ListNode, *next); Void Union (List LA, List LB); / / the Union Void intersection (List LA, List LB); / / take the intersection }; ListNode *List:: getNode (double, item, Li