ouBL LINRED LIST

to reae a alousy
De lo oroqsam

oih methods
linked ist
oeuit uncns :

0 Tnsert do de First
No de Last
Tsert
p
eNeTse List
ven No de

Tsert e iven Aode

Dete First do de
Dalate Lost AJode

ODehbe aer iven ode

Delete ven Jo de
Dedte e
Count
# intude c alloc.h>
## indude stdio.h>
#innde stJt.h>

srut node
1 in data,
Stu o de Pre

Stsu ode next

, end sutode

u c t no de Head NULL

. Insert do de Fiat
Void isert Fvont ( i t num)
tvu ao de n o de ,
neonode ( sha rode ) malloc Cige
Ct node )) ;

n s node data a num

nenoda nent Head

Lono de prreN NULL

Head a aJULL
Hed pre e o node

Herd neonode,
3 end inLertFront
| 2. Test Sode Last

vaid insartLaut i nu

stT nodeP * ne-onode,

neanode (struut rode") malloe (
Cshu sode)):
eonode > Jata a num;

A no de nenta NULL

Head a= NULL)

Head neonode,
else
Hed
P
Pnext;

> nent NULL,

newnode

P>nenE= n eondde

neo no de PT

3l end i l e
l 2md inertloaE.
Void
depla
P
ode
Hed

pi % d, M
", p> dba);
P nent

3 d*
Bph Reverse Lict
vad dipl Raw l)

Srut node

P Head;
CHend : NULL)

wo l po nent I a JULL)
Pap|nent;

o u la Cpl ULL)
pa data )
P
Pre

lnd dsplayRau
k:Tnserttor ven 9ode.

interA ( u t val, at num)

stmet nae *ALOnDde sP

Head JULL)
pri Uet i Empy")
ele
P Head
LL Pdakada Val)
P:pnekt;

NvLL

dode Jot Fownd "),

e

nes node s t u e noda *malloL

C C t-nu rode));

nuonode data num

net

P nent neo ADde,

Cnwonode nent!= ULL)

3lend e
3l end
vid
sut.
. T«t orAapven Jsde
Vid itert A C i v a , it um

Suw no de P*neono de
Hend a JULL

( ut is ¬mpky

elne

p Hend

o i l ( a VLL 44 da Val
panent,

Not Found ");

Node
else
wonade Lst-ruet nade) mallo (
Catre de );
num
daba a

ARsnD de

nOd e s
Aam P
O
prev

neono de prew NULL

neurode ;
rs node prev9 n
elae
Hend monode,
d ake ig

Jlendisestsore
e t e Fint ode.
Vd JsaeFist )

skuu de *

Hend NULL

else
nent ==
NULL)
Mend
tpa Herd
P "d delated Hend data)
Hed a NULL

ee
Med

dela tes ", Hends dta );

nemt
Head
Hend ;
DTEN
JULL,
Hend

31 Jalse nt
end deluteFiat
&.Duke last aode

d t e Last [)

Strut ode

(Hend= JvLL)

olse
P: Hed
Mexd Nent = a NvLL)

p d dolsted ", Haads daba

Hend NULL,

end
ele

P
delated ',pamt > daba);
nat ( p d
P
NULL,
n t : NULL

3 lnd

and deletlaot
a. lube te ve a

dalebe 4ltr ival)

vd
Sh-uut node

Head = NULL)

else

Hend

n ent

NULL

dode ot ound)
ra
ese

delsted ", p>rewk>daka).

3l end e par
dalete t .
lnd
l0. lste bepore ven a

Vd delate bre ia vol

1 Ao d e
P
Hend a AJULL ))

ele

Hed

= NULL)

pa'CJo de
dot Fns");
elte

d dehted,p*praw data);
Pre PT
ppis NULL

pae nenta

He

Send
end
d delete befr
Dlute a 2ve no de

vaid deltebde ( v a )
strut node

CHead JULL)
( L i t i Emp
else

P Hed
lile p l JULL 4 p data !va)
PpneE

NULL)
Jode dot
Found *);
piat
ele
pr(94ddelted ", pa daka )

prey!a JULL)

PpTe nert P net

P nen> pTew: pRev
3l end

elne
Head p nent,

3led ert

end d e t e AVode
J
 Count
v ount C)

Showt o de

He NULL)
PHead,

Pnent
S llend oula

( TAmber odes ave :V,d ", c);

3ed tount
 int main )

i c , num, va,

prt(1. Itert dode First ");

a t *);
*2. Ime«t Node
pint
ust ");
i 3 . Dipla
iC DipRawecie ist *);
rint s . Inerta ie ode ");
given ode" )

i . Deebe et n "

ode
t. Ddt t )
ri 4 Dokre v e n a de);
ven o de)
p r t [ * u. D t e a *^de *):
ve0
Pi 12. Count b
B. E
Pi C
pr Ene Choie ")

SuoiteCeh)
Case 1:
Eater number: "
Priat
 inst Front ( nunm)
brek
2
COA
pri C Entt Aumbe "),

Sa C d tnum);
sedlaot(hum,
brek

Caoe 3:

Jsplay );

Case :

display Res C);

Case S

Sen C* d " ,4 num);

vatue no de

Ccon Cd ,fvat);°

ertAk v a ,
num
);
brenkj
Case 6

CEnts Ammbe

Scen d ", num

);
tCEater value ode ),
Sco( va
isert ee (val, um);
brek

delate Firt ();

rek

Cane

deute Lost C);

real
Caoe

P E»ter vaa de ");

Sea 7od 4 va) ,

dle Aer ba) ;

sek

Cooe 10 :

i C E t e r val ode ):
SCan (w d ,4val
Scndute elare tyat);
bre
Cooe l
Ester valu ode
i
Son 9oJ , 4 val
dee odel vat);
brerk
case 12:

Coturt
breki5
Cae 13:

ent (o)D;
brek
deat

Cui ted

3 lend l

ld ma n