List Traversals

To traverse a list is to move from one end to the other, "visiting" each node along the way.
- Forward traversals go from head to tail.
- Reverse traversals go from tail to head.
- The meaning of visiting a node is left unspecified at this point.
- The meaning will be specified at the time of the traversal.

Traversal Function Prototype. void Traverse(void (* Visit) (ListIterator&))

Traversals and Iterators

A traversal may be implemented as follows.

    for (ListIterator it(list); !it.AtEnd(); ++it)
        Visit(it);

Reverse Traversals
- Use a separate function ReverseTraverse().
- ReverseTraverse() uses a reverse iterator.

This page was last modified on Mar 28, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/ListTraversals.html