Help ... I don't understand link list very well. Can someone help me how to translate an algorithm or explain how I can put them in linked list format?

Here is the algorithm:

1.) Set the next part of the node referred to by predptr equal to the next part of the node pointed to by ptr.
2.) Return the node pointed to by ptr to the storage pool.

The textbook I have don't have that much example that I can follow. Please help..

Thank you.

Definition:
predptr points to the previous node in the linked list
ptr points to the current node
nextptr (added for this discription) points to the next node in the linked list
In each, the next value points to the next node in the list -- from that node's standpoint. IOW
-- the next value in predptr points ptr
-- the next value in ptr points nextptr

Algorithm:
1) Take the current pointer's next value and copy it into the previous pointer's next value. This effectively makes the previous node's next value point to nextptr. This unlinks ptr from the linked list.
2) Delete ptr.

__________________

Age is unimportant -- except in cheese