-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathImplementation_SinglyLinkList.c
132 lines (103 loc) · 2.17 KB
/
Implementation_SinglyLinkList.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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct sinL
{
struct node *head;
};
void init(struct sinL *l)
{
l->head=NULL;
}
void addnode(struct sinL *l, int x)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
if (temp == NULL)
{
printf("No memory get.");
}
else
{
if (l->head == NULL)
{
l->head = temp;
temp->data = x;
temp->next = NULL;
}
else
{
struct node *t = l->head;
while (t->next != NULL)
{
t = t->next;
}
t->next = temp;
temp->data = x;
temp->next = NULL;
}
}
}
void searchnode(struct sinL *l, int x)
{
struct node *temp = l->head;
while(temp->data != x && temp->next != NULL)
{
temp = temp->next;
}
if (temp->data == x)
{
printf("\nYour Data is found at address %p.",temp);
}
else
{
printf("\nData Not Found.");
}
}
void displaynode(struct sinL *l)
{
struct node *temp = l->head;
while(temp->next != NULL)
{
printf("\n %d ",temp->data);
temp = temp->next;
}
printf("\n %d ",temp->data);
}
int main()
{
struct sinL l;
int x;
int n;
init(&l);
do
{
printf("\n1.Add Data");
printf("\n2.Search Data");
printf("\n3.Display Data");
printf("\n4.exit");
printf("\nChoose any one : ");
scanf("%d",&n);
switch (n)
{
case 1:
printf("\nEnter data you want to enter : ");
scanf("%d",&x);
addnode(&l, x);
break;
case 2:
printf("Enter data you want to Search : ");
scanf("%d",&x);
searchnode(&l, x);
break;
case 3:
displaynode(&l);
break;
default:
break;
}
} while (n != 4);
}