9. LINKED LIST: DELETE node at a given POSITION [ANIMATED] [WITH CODE] | Data Structure Full Course
DEL(INFO, LINK, START, AVAIL, LOC, LOCP)
This algorithm deletes the node N with location LOC. LOCP is the location of the node which precedes N or, when N is the first node, LOCP = NULL.
1. If LOCP = NULL, then:
Set START:= LINK[START]. (Deletes first node.)
Else:
Set LINK[LOCP] := LINK[LOC]. [Deletes node N.)
(End of if structure.)
2. (Return deleted node to the AVAIL list.)
Set LINK[LOC] := AVAIL and AVAIL:=LOC.
3. Exit.
My socials:
[email protected]
https://psnacademy.in
/ psnayak
/ psnayakeducator
https://www.buymeacoffee.com/psnayak
/ psnayak2007
Note: This video is copyrighted, no part of it to be reproduced or republished.
Thumbnail background image by Gya Than Arts from Pixabay.