头插法和尾插法图文并茂

叁歲伎倆 2021-09-22 12:28 474阅读 0赞

![20180603101231864][]

1.  `#include "stdio.h"`
2.  `#include "stdlib.h"`
3.  `typedef struct List {`
4.  `int data; //数据域`
5.  `struct List *next; //指针域`
6.  `} List;`
7.   
8.   
9.  `void TailCreatList(List *L) //尾插法建立链表`
10. `{`
11. `List *s, *r;//s用来指向新生成的节点。r始终指向L的终端节点。`
12. `r = L; //r指向了头节点，此时的头节点是终端节点。`
13. `for (int i = 0; i < 10; i++) {`
14. `s = (struct List*) malloc(sizeof(struct List));//s指向新申请的节点`
15. `s->data = i; //用新节点的数据域来接受i`
16. `r->next = s; //用r来接纳新节点`
17. `r = s; //r指向终端节点`
18. `}`
19. `r->next = NULL; //元素已经全部装入链表L中`
20. `//L的终端节点指针域为NULL，L建立完成`
21.  
22. `}`
23.  
24.  
25. `void HeadCreatList(List *L) //头插法建立链表`
26. `{`
27. `List *s; //不用像尾插法一样生成一个终端节点。`
28. `L->next = NULL;`
29. `for (int i = 0; i < 10; i++) {`
30. `s = (struct List*) malloc(sizeof(struct List));`
31. `s->data = i;`
32. `s->next = L->next; //将L指向的地址赋值给S;//头插法与尾插法的不同之处主要在此，`
33. `//s所指的新节点的指针域next指向L中的开始节点`
34. `L->next = s; //头指针的指针域next指向s节点，使得s成为开始节点。`
35. `}`
36. `}`
37.  
38.  
39. `void DisPlay(List *L) { //打印节点`
40. `List *p = L->next;`
41. `while (p != NULL) {`
42. `printf("%d ", p->data);`
43. `p = p->next;`
44. `}`
45. `printf("\n");`
46. `}`
47.  
48. `int main() {`
49. `List *L1, *L2;`
50. `L1 = (struct List*) malloc(sizeof(struct List));`
51. `L2 = (struct List*) malloc(sizeof(struct List));`
52. `HeadCreatList(L1);`
53. `DisPlay(L1);`
54. `TailCreatList(L2);`
55. `DisPlay(L2);`
56. `}`

文章转载于：https://blog.csdn.net/Fire\_Sky\_Ho/article/details/78072052?locationNum=4&fps=1

[20180603101231864]: /images/20210920/967a44c6982843eb9bfa55be2fe14cf7.png