//非循环单链表带头结点的部分操作
/*运行结果:
Linklist is: 1 3 4
Delete 1 Linklist is: 3 4
clear Linklist is: Linklist is empty.
Insert 2 Linklist is: 2
Linklist is destoryed.Insert failded
请按任意键继续. . .
*/
# include <stdio.h>
# include <stdlib.h>
# define bool int
# define true 1
# define false 0
typedef int ElemType;
typedef struct Node{
ElemType data;//数据域
struct Node * next;//指针域
}Node, *Link;
Link InitLink();//创建链表头结点
bool InsertNode(Link Head, ElemType data);//按顺序插入链表结点
bool DeleteNode(Link Head, ElemType data);//删除链表结点
bool IsEmpty(Link Head);//判断链表是否为空
void traverse(Link Head);//遍历链表
v