26.1 Iterators (cont.)

• Interface for a linked list is more complicated
• Adding/removing in the middle desired
• Indices inefficient
• Cursors (internal iterators) are one solution:

---

prev |top |next