-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist2.c
69 lines (65 loc) · 1.38 KB
/
linkedlist2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
void append(struct node** ,int);
int main()
{
int ch,data;
struct node * start=NULL;
do{
printf("Single list operation: \n");
printf("1.Append\n");
printf("2.Addatbegin\n");
printf("3.Addatafter\n");
printf("4.Length\n");
printf("5.Display\n");
printf("6.Delete\n");
printf("7.Quit\n");
printf("\n\nEnter your choice: ");
scanf("%d",&ch);
} while(1);
return 0;
switch (ch)
{
case 1 : printf("Enter the data : ");
scanf("%d",&data);
append(&start,data);
break;
case 2 : addAtbegin();
break;
case 3 : addatafter();
break;
case 4 : length();
break;;
case 5 : display();
break;
case 6 : delete();
break;
case 7 : exit(1);
default:
printf("Invalid choice\nPlease chose another option\n");
break;
}
}
void append(struct node **ps , int x)
{
struct node *p, *temp;
p=(struct node *)malloc(sizeof(struct node));
p->data=x;
p->next==NULL;
if(*ps==NULL)
{
*ps=p;
return;
}
temp=*ps;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=p;
}