文件名称:dlb
介绍说明－－下载内容均来自于网络，请自行研究使用
对单链表进行元素的插入和删除操作。要求:1）用头插法或尾插法（头插法指新元素总是从头部插入；尾插法指新元素总是从尾部插入）建立一个单链表（带头结点），并输出，观察输入的内容与输出的内容是否次序相反。
注意：单链表中头结点、开始结点、尾结点的区分。
2）实现单链表的插入操作（在带头结点的单链表中第I个位置插入新元素）。
3）实现单链表的删除操作（在带头结点的单链表中删除第I个元素）。
-Single list of elements to insert and delete operations. Requirements: 1) head or tail interpolation interpolation (interpolation refers to the first new element is always inserted from the head tail interpolation refers to the new element is always inserted from the rear) to establish a single list (the lead node) and output to observe the input and output if the contents of the order of the contrary. Note: single-linked list in the first node to start node, end node distinction. 2) the realization of single-chain insertion operations (in the lead node of the single list in the first places I insert a new element). 3) the realization of a single list of delete operations (in the lead node of the single-linked list to delete the first I elements).
注意：单链表中头结点、开始结点、尾结点的区分。
2）实现单链表的插入操作（在带头结点的单链表中第I个位置插入新元素）。
3）实现单链表的删除操作（在带头结点的单链表中删除第I个元素）。
-Single list of elements to insert and delete operations. Requirements: 1) head or tail interpolation interpolation (interpolation refers to the first new element is always inserted from the head tail interpolation refers to the new element is always inserted from the rear) to establish a single list (the lead node) and output to observe the input and output if the contents of the order of the contrary. Note: single-linked list in the first node to start node, end node distinction. 2) the realization of single-chain insertion operations (in the lead node of the single list in the first places I insert a new element). 3) the realization of a single list of delete operations (in the lead node of the single-linked list to delete the first I elements).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
dlb.c