文件名称:linklist
介绍说明--下载内容均来自于网络,请自行研究使用
根据线性表的抽象数据类型的定义,选择下面任一种链式结构实现线性表, 并完成线性表的基本功能。 线性表存储结构(五选一): 1、 带头结点的单链表 2、 不带头结点的单链表 3、 循环链表 4、 双链表 5、 静态链表 线性表的基本功能: 1、构造:使用头插法、尾插法两种方法 2、插入:要求建立的链表按照关键字从小到大有序 3、删除 4、查找 5、获取链表长度 6、销毁 7、其他:可自行定义 编写测试main()函数测试线性表的正确性-According to the linear form of abstract data type definition, select a chain structure to achieve any of the following linear form, and complete the basic functions of the linear form. Linear table storage structure (five choose one): 1, the lead single linked list nodes 2, do not take the lead in a single linked list nodes 3, 4 circular list, double-linked list five basic functions of linear static list table: 1, Construction: Use Head interpolation method, two methods tail interpolation 2, insert: in accordance with the requirements established in the keyword list from small to large order 3, 4 deleted, find 5 to get the list length 6, 7 destroyed, other: You can define your own writing test main () function to test the accuracy of the linear form
(系统自动生成,下载前可以参看下载内容)
下载文件列表
linklist.cpp