Program 24
Program 24
nt data
Struct node next
irst nN
int Search (int item
int Count
n & -first
while nwnext= NULL)
Dreak
else
Count t+,
w nw next
retoryn Count
int main )
int no, , tem, pos
irst. next NULL
8Cirst
hodes you want
n lnked t :")
printf (M Ho many
printf (n")
for (t o, t< ho; ir+)
rode)
ho- next (Struct node) malloc(sizeof(struct
printf ("Enier element in node ,d i+1),
Scanf (%d", mw data)
nwhu next
nw hext NULL
in linked List: mn");
print C /n Element
nw: fist
ohile ( nus nert= NULL
print(w');
printf n Enter element to be Searchtd)
Stanf7dy item)
poS Search (tem)
f pos & no)
printt (w' 7.d is fouond ot node 7. d',item, pos)
else
printf CSorry7dis not in linked li'st ", iten)
felurn D,
0utbot
How many nodes you want n linked list ?: 6
Enter element in
node : 5
Enter element in node 2 9
Enter element in node 3 :
88
Enter element in node4 21
Enter element in node. 5: 6
Enter element in node 6:
86
Elements in inked List
88
Enter element
86
o be
Searche d: 27
21 s found at node 4