1)键盘输入一组元素，建立一个无头结点的单向链表（无）

(2)遍历（打印）单向链表。

(3)把单向链表中元素逆置（不允许申请新的结点空间）。

(4)在单向链表中删除所有的偶数元素结点。

(5)对链表排序，排序后链表元素按照非递减 方式排列

（注意：排序时如果要交换两个结点的顺序，不得通过交换结点的内容，而需要使用改变指针的方式交换结点的位置。建议使用直接插入排序算法）。

(6)利用算法5建立两个非递减有序单向链表，然后合并成一个非递减链表。

(7)利用算法1建立的链表，删除链表中的重复元素。

(8)利用算法1建立的链表，实现将其分解成两个链表，其中一个全部为奇数，另一个全部为偶数（尽量利用已知的存储空间）。

(9)判断算法1和算法5生成单链表所表示的集合是否相等。

(10)在主函数中设计一个简单的菜单，分别调试上述算法。

【选作内容】

(11)利用算法5建立两个非递减有序单向链表，然后合并成一个非递增链表。

(12)采用单向链表实现一元多项式的存储并实现两个多项式相加并输出结果。-1) a set of keyboard input elements, the first node to create a free one-way linked list (no)

(2) through (Print) one-way linked list.

(3) to reverse a singly linked list of elements in set (not allowed to apply for a new node space).

(4) one-way linked list even remove all of the elements node.

(5) sort the list, sorted list elements are arranged in accordance with non-decreasing

(Note: If you want to sort the order of exchange of two nodes, not by the content of the exchange node, while the need to change the way the exchange node pointer position is recommended to use direct insertion sort algorithm).

(6) the use of algorithms to create two non-decreasing order 5 one-way linked list, and then merged into a non-decreasing list.

(7) the use of Algorithm 1 to establish the list, delete the list of repeat elements.

(8) the establishment of the list using Algorithm 1, to achieve its broken down into two lists, one of which all of the odd, the other all the even (make full