Linked List
Procedure LinkedEnqueue (X)
Start with the head of the list and locate Y
whose time is greater than X
Insert X directly before Y in the list
Procedure LinkedDequeue
Remove X from the head of the list
Procedure LinkedCancel (X)
Start with the head of the list and traverse to locate X
Delete this item from the list by:
(1) Letting X be between items A and B
(2) Creating a new variable T to point as B
(3) Removing X from dynamic storage
(4) Making A point directly to B using Ts value