带头结点的单向链表的链表创建和删除等操作

带头结点的单向链表的结点插入和删除等操作

将两个按年龄递增顺序的单向链表合并为一个链表

要求合并后的链表按年龄递减

同名同年龄的节点可认为表示的是同一个学生

每个学生在合并后的链表中仅出现一次

打印输出合并后的链表元素，验证结果的正确性

-Lead the singly linked list of nodes of operations such as creation and deletion

Lead the nodes of the singly linked list of insert and delete operations

The two according to the order of increasing age, singly linked list into a list

Require the merged list according to age

The same age with the same node representation can be thought of as the same students

Each student in the merged appear only once in the list

Print the merged list elements, to prove the validity of the results