链表 2：建立链表的两种方法

建立链表的两种方法：头插法与尾插法
/*都有一个头结点*/

 

 

#include <stdio.h> #include <stdlib.h> typedef char datatype; typedef unsigned cnttype; typedef struct node{ datatype data; struct node *next; }node; /*头插法建立链表*/ node *make_chain (datatype *string) { node *head; node *temp; cnttype i; head = (node *)calloc(1, sizeof(node)); head-> next = NULL; for (i = 0; string[i]; i++) { temp = (node *)calloc(1, sizeof(node)); temp->data = string[i]; temp->next = head->next; head->next = temp; } return head; } /*尾插法建立链表*/ node *make_chain (datatype *string) { node *head; node *temp; node *tail; cnttype i; head = (node *)calloc(1, sizeof(node)); head->next = NULL; tail = head; for (i = 0;string[i]; i++) { temp = (node *)calloc(1, sizeof(node)); temp->data = string[i]; tail->next = temp; tail = temp; } tail->next = NULL; return head; }

 

 

 

/*由以上可以看出采用头插法时候链表的顺序与string中的字母顺序恰好相反
而采用尾插法建立时则用到一个tail指针指向链表的尾节点*/