Linked lists
============
This section focuses on a sequential data structure in which
data elements do not occupy a continuous block of memory.
While linked list are useful, they do present a problem
that will need to be solved: visiting the next linked
list item in a generic way.

We use this problem as our springboard for iterators.

.. toctree::
   :maxdepth: 2

   list.rst
   list-analysis.rst
   forward-list.rst
   iterators.rst
   iterator-pattern.rst
   iterator-operations.rst
   using.rst