//结点定义 typedef struct node { elemtype data; struct node *next; } Linklist; //一.单链表 //1.链表的建立 //a .尾插法 Linklist * init() { Linklist *head; Linklist *temp; int i = 0; head = (Linklist *)malloc(sizeof(Linklist)); head->next = null; for ( ; i < 10 ; i ++) { temp = (Linklist *)malloc(sizeof(Linklist)); temp->data = i; temp - > next = head - >next; head - > next = temp; } return head; } //b.头插法 Linklist *init() { Linklist *head; Linklist *p; Linkist *temp; int i; head = (Linklist *)malloc(sizeof(Linklist)); head - > next = null; p = head; while(i < 10) { temp = (Linklist *)malloc(sizeof(Linklist)); temp - >data = i; p - > next = temp; p = temp; i ++; } return head; }