Take the program of
exercise 6
and replace the list implement with C structs with a class, too.
This exercise requires some knowledge in data structures and algorithms.
The simplest solution is to use a helper class which represents a node
within a list plus the actual class List which keeps pointers to
the first node and a "current" node. The "current" mode determines
the position where insertions will be done.
A more elaborate solution provides a third class which represents a
position with a list. This concept is called "iterator". It has
the advantage that one can have more than one "current" position
in a list.