Traversing a list's records is another operation performed on the data abstraction called the list. Traversal is useful when the records are to be processed one after another in the same order in which they appear in the list. A traversal may be accomplished by following the pointer in the list's head to the first record and processing it, then following the first record's link field pointer to the next record and processing it, and so on, until the last record has been processed.
3.4.1 List Reversal Using a Loop
3.4.2 A General List Traversal Using a Loop
3.4.3 The Merits of Functional Modularization