Delete(L)
Delete(L)
Procedure to delete the current node in L and to have
the current position indicate the next node; if the
current node is the last node the current
position becomes empty;
StoreInfo(L,e)
Procedure to update the information portion of the
current node to contain e; assume the current position is
nonempty
RetrieveInfo(L) ? e
Function to return the information in the current node;
assume the current position is nonempty