Any problem

LENKED LIST DELETEAG NODES ( LINKED LIST DELETING NobéS h3
Nae in ngly Linked Lip+ beletng the Lat node 'n ingy Linked& Li's+
Deletinghe fivat
Algorthm
Algorithms
deleted is+ (START) Deleng (STAAT
Under
flow
StepL: Check fer underflew
Check for
StepL I f t r NuLL han
=
NULL, thun
Stat
If Prink Lik Li's is empky
Pi'w
uinkel Lst Empty Exit
Stepa fStart Next NULL hem
START Set Phr : Start
set PTRz
Stee 2 STAATNax
Se start= NULL
STAAT =
set
Step 8lement
delcted is phr>ifa Pit elemamt deluked is PTR >Info
Print
S+ep
StePS free CP). free (PTR
endf
Stoe PTA START
Step3 set
S+ep4 Repeat S+ep Somd 6 Until
A f t e r &eielion PTANext =NULL
PTR
20 Step s: s t LOC
Set PTR= PTR Next
S4ep6

, Sek Loc Next NULL
48 LINKED LIST DELETENG NODES 49
Stee Specrfiecl Position
belehng the Nede from
Step free (eTA)
In &gly Liwkad ui
Star LoC
Algorithm
Delete LoCation (STAAT, LOC
After dehion Check fov Under flow
Step L
Sstarcd f PTA: NULL them
priwt Underflow
I emed poinkers
Tni'tialze the Counher
Step 2
Se+ T : O ;
Se p r Star
Repeat Step 4 to 6 untl I< LO
Step3:
Step4 Set+emp PTR
set PTR = PTR Nex+
Steps
T+1
Sek I :
Step