4-18 易错点 链表的创建和添加

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 
 4 typedef struct NODE
 5 {
 6     int id;
 7     char *name;
 8     char *tel;
 9     struct NODE *next;
10 }Node;
11 Node *GetNode(int id,char *name,char *tel);
12 void addNode(Node **ppHead,Node **ppEnd,Node *pNode);
13 int main()
14 {
15     Node *pHead = NULL;     //1
16     Node *pEnd = NULL;
17 
18     addNode(&pHead,&pEnd,GetNode(1,"cyc","164864613521"));
19     addNode(&pHead,&pEnd,GetNode(2,"xmx","164864613521"));
20     addNode(&pHead,&pEnd,GetNode(3,"wdh","164864613521"));
21     addNode(&pHead,&pEnd,GetNode(4,"yk","164864613521"));
22 
23     while(pHead != NULL)
24     {
25         printf("%d    %s    %s\n",pHead->id,pHead->name,pHead->tel);
26         pHead = pHead->next;
27     }
28 
29 
30 
31     return 0;
32 }
33 Node *GetNode(int id,char *name,char *tel)
34 {
35     Node *pTemp = (Node *)malloc(sizeof(Node));
36     pTemp->id = id;
37     pTemp->name = name;
38     pTemp->tel = tel;
39     pTemp->next = NULL;
40 
41     return pTemp;
42 }
43 void addNode(Node **ppHead,Node **ppEnd,Node *pNode)   // 2
44 {
45     if(*ppHead == NULL)
46     {
47         *ppHead = pNode;
48         *ppEnd = pNode;
49     }
50     else
51     {
52         (*ppEnd)->next = pNode;
53         *ppEnd = pNode;
54     }
55     return;
56 
57 }