13. 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.

• 13.1. The list class
• 13.2. Analysis of list operators
• 13.3. std::forward_list
• 13.4. Iterable ADT’s
• 13.5. Iterator pattern
• 13.6. Basic iterator operations
  • 13.6.1. Iterator categories
• 13.7. Using iterators
  • 13.7.1. Limits of Range-based for loops
  • 13.7.2. Container functions that require iterators

You have attempted of activities on this page