List Deletion

• Let H be a pointer to a linked list of nodes, and let each of P and Lag be a variable whose value is a pointer to a node. Let v be the value of the node to be deleted.

If H = null then return

If H.info = v then H := H.link

Lag := H

P := H.link

If P = null Return

While P.info != v & P.link != null

Lag := P

P := P.link

If P.info = v then Lag.link := P.link

P := search(H,v)

If P = null then return

If P = H then

H = H.link

Else lag := P.blink

lag.link := P.flink

Singly-linked list

Doubley-linked list

Previous slide

Next slide

Back to first slide

View graphic version