Algorithm for Traversing a Singly Linked List

1. Make currentNode point to the first node in the list. 

2. Repeat the steps 3 and 4, until currentNode becomes NULL.

3. Display the information contained in the node marked as currentNode.

4. Make currentNode point to the next node in the sequence.