This section is now aligned to the table of contents from Data Structures and Algorithms using Python by Rance Necaise.
Book chapter coverage in this section
| Book chapter | Topic | Our page(s) | Coverage |
|---|---|---|---|
| Chapter 1 | Abstract Data Types | Abstract Data Types (ADTs) | Covered |
| Chapter 2 | Data Structures (bags, maps, iterators) | Bag, Hash Table | Partial |
| Chapter 3 | Arrays and Vectors | Arrays, Typed Arrays | Partial |
| Chapter 4 | Multi-Dimensional Arrays | Multi-Dimensional Arrays & Matrix ADT | Covered |
| Chapter 7 | Linked Structures | Linked List | Covered |
| Chapter 8 | Queues | Stack & Queue | Covered |
| Chapter 9 | Stacks | Stack & Queue | Covered |
| Chapter 10 | Advanced Linked Lists | Advanced Linked Lists | Covered |
| Chapter 11 | Hash Tables | Hash Table | Covered |
| Chapter 14 | Binary Trees | Trees (BST) | Covered |
| Chapter 15 | Search Trees | Trees (BST) | Partial |
Algorithms chapters from the same book
The following book chapters are tracked in the algorithms section:
- Chapter 5. Algorithm Analysis
- Chapter 6. Searching and Sorting
- Chapter 12. Recursion
- Chapter 13. Advanced Sorting
Extra data structure topics in this curriculum
These are not chapter titles in the Necaise TOC, but they are part of our learning path:
How to study this section
- Follow the chapter order above.
- Type each implementation yourself.
- Test edge cases: empty, single-item, duplicate-heavy, invalid inputs.
- Keep a personal cheat sheet of operation costs and invariants.
TOC source: datastructures.necaise.org/TableOfContents. I reviewed all listed chapters (1-15), with detailed subsection entries currently published for chapters 1-9.