52. Iterator

• Problem to solve:

  • Consider a container of elements, or some other type of aggregation.

  • How could we examine the elements held in the container?

  • The challenge is that client has no knowledge about

    • container type (tree, linked list, hash table, array, etc.)

    • container size

    • keys of associative containers

  • The client wants a uniform interface to navigate container elements while applying various algorithms of traversal.