Write down a C Program to insert in beginning & end, delete a node in beginning & end, Traverse for the singly linked list and also modify a specified node for the Singly Linked List using Global start variable & call by reference & by using the Switch Case

Write down a C Program to insert in beginning & end, delete a node in beginning & end, Traverse for the Singly Linked List and also modify a specified node for the Singly Linked List using Global start variable & call by reference & by using the Switch Case.

1. #include <stdio.h>
2. #include <stdlib.h>
3. #include <malloc.h>
4. struct node 
5. {
6. int data;
7. struct node *next;
8. };
9. struct node *start=NULL;
10. void create_nodebegining(int);
11. void create_nodeend(int);
12. void delete_nodebegining();
13. void delete_nodeend();
14. void modify(int,int);
15. void traverse();
16. int main()
17. {
18. int data,i,n,ch,data1;
19. printf("\n Enter The Value of data to be Entered:\n");
20. scanf("%d",&n);
21. for(i=0;i<n;i++)
22. {
23. printf("\n Enter The Value Should be Enter In Data of Node:\n");
24. scanf("%d",&data);
25. create_nodeend(data);
26. }
27. printf("\n Please Enter Your Choise \n ");
28. printf("\n Press 1 for Insert in Beginning \n Press 2 for Insert in end \n Press 3 Delete in Beginning \n Press 4 for delete in end \n Press 5 for modify \n press 6 for traverse \n");
29. scanf("%d",&ch);
30. switch(ch)
31. {
32. case 1:
33. printf("\n Enter The Value For Node Data:\n");
34. scanf("%d",&data);
35. create_nodebegining(data);
36. break;
37. case 2:
38. printf("\n Enter The Value For Node Data:\n");
39. scanf("%d",&data);
40. create_nodeend(data);
41. break;
42. case 3:
43. delete_nodebegining();
44. break;
45. case 4:
46. delete_nodeend();
47. break;
48. case 5:
49. printf("\n Enter The Data To be Modified:\n");
50. scanf("%d",&data1);
51. printf("\n Enter The Data Modified:\n");
52. scanf("%d",&data);
53. modify(data1,data);
54. break;
55. case 6:
56. traverse();
57. break;
59. }
60. traverse();
61. }
62. void create_nodeend(int x)
63. {
64. struct node *t,*t1;
65. t=(struct node*)malloc(sizeof(struct node));
66. t->data=x;
67. t->next=NULL;
68. if(start==NULL)
69. {
70. start=t;
71. }
72. else
73. {
74. t1=start;
75. while(t1->next!=NULL)
76. {
77. t1=t1->next;
78. }
79. t1->next=t;
80. }
81. }
82. void create_nodebegining(int x)
83. {
84. struct node *t,*t1;
85. t=(struct node*)malloc(sizeof(struct node));
86. t1=start;
87. t->data=x;
88. t->next=t1;
89. start=t;
90. traverse();
91. }
92. void delete_nodeend()
93. {
94. int d;
95. struct node *t,*t1;
96. t=start;
97. while(t->next!=NULL)
98. {
99. t1=t;
100. t=t->next;
101. }
102. d=t->data;
103. free(t);
104. t1->next=NULL;
105. traverse();
106. }
107. void delete_nodebegining()
108. {
109. int d;
110. struct node *t,*t1;
111. t=start->next;
112. d=start->data;
113. free(start);
114. start=t;
115. traverse();
116. }
117. void modify(int x,int y)
118. {
119. struct node *t;
120. t=start;
121. while(t->data!=x)
122. {
123. t=t->next;
124. }
125. t->data=y;
126. traverse();
127. }
128. void traverse()
129. {
130. struct node *t;
131. t=start;
132. while(t->next!=NULL)
133. {
134. printf("\n %d",t->data);
135. t=t->next;
136. }
137. printf("\n %d\n\n",t->data);
138. }