单链表的创建，查找，删除，插入。

1. #include <stdio.h>
2. #include <string.h>
3. #include <stdlib.h>
4. //定义学生的结构体
5. typedef struct stu
6. {
7. int id;
8. char name[20];
9. struct stu * next;
10. }stu;
11. 
    
12. //该函数是创建学生信息
13. stu *Create_chain()
14. {
15.      stu* head = NULL;
16. stu* p1 = NULL;
17. stu* p2 = NULL;
18. p1 = (stu*)malloc(1*sizeof(stu));
19. printf("please input a stu infor\n");
20.      scanf("%d%s", &(p1->id), p1->name);
21. p2 = head = p1;
22. while(p1->id != 0)
23. {
24. p1 = (stu*)malloc(1*sizeof(stu));
25.     printf("please input a stu infor\n");
26.          scanf("%d%s", &(p1->id), p1->name);
27.          
28. p2->next = p1;
29. p2 = p1;
30. }
31.      p2->next = NULL;
32. return head;
33. }
34. //该函数是打印学生信息
35. void Print_chain(stu * head)
36. {
37.     stu *p;
38.     p = head;
39.     while(p->next != NULL)
40. {
41.     printf("%-12d%-12s\n",p->id, p->name);
42. p = p->next;
43. }
44. 
    
45. }
46. //该函数是插入学生信息

1. void Insert_info(stu* head, stu* temp)
2. {
3.      stu* p1 = NULL;
4. stu* p2 = NULL;
5. p1 = head;
6. if(head == NULL)
7. {
8. head = temp;
9. temp->next = NULL;
10. }
11. else
12. {
13. while((p1->next != NULL) && (p1->id<temp->id))
14. {
15. p2 = p1;
16. p1 = p1->next;
17. }
18. if(p1->id > temp->id)
19. {
20. p2->next = temp;
21. temp->next = p1;
22. }
23. if (p1->next == NULL)
24. {
25. p1->next = temp;
26. temp->next = NULL;
27. }
28. }
29. }
30. 
    
31. 
    
32. stu* Delete_info(stu* head, int id)
33. {
34.     stu* p1 = NULL;
35. stu* p2 = NULL;
36. p1 = head;
38. if (head == NULL)
39. {
40. printf("not exist stu_info\n");
41. return head;
42. }
44. while((p1->next != NULL)&& (p1->id != id))
45. {
46. p2 = p1;
47.    p1 = p1->next;
48. }
49. if (p1->id == id)
50. {
51. if (p1 == head)
52. {
53. head = p1->next;
54. }
55. else 
56. {
57.             p2->next = p1->next;
58. }
59. }
60. else
61. {
62.    printf("not find the stu\n ");
63. }
64.     return head;
65. }
66. 
    
67. 
    
68. 
    
69. void Free_chain(stu* head)
70. {
71.     stu *p;
72.     p = head;
73.     while(p->next != NULL)
74. {
75.     free(p);
76. p = p->next;
77. }
78. }
79. 
    
80. 
    
81. int main()
82. {
83. int id ;
84. stu* head;
85. stu* tmp = (stu*)malloc(1*sizeof(stu));
86.     head = Create_chain();
87. Print_chain(head);
88. puts("please input stu info\n");
89. scanf("%d%s", &tmp->id, tmp->name);
90. Insert_info(head, tmp);
91. Print_chain(head);
92. printf("please input the id you want delete\n");
93.     scanf("%d\n", &id);
94. head = Delete_info(head, id);
95. Print_chain(head);
96. Free_chain(head);
97. return 0;
98. }