Module P-4
Data Structures
How to hold data so that the operations you perform most often are the cheap ones: arrays that grow, linked storage, last-in and first-out access, hash tables, ordered trees, heaps, and the several ways to represent a graph.
7 topics ~76 h estimated learning time
Comes after—
Unlocks—
Sign in to keep your progress.
Ready to start
- P-4.1 Arrays and Dynamic Arrays
Core · 10 h
- P-4.2 Linked Lists
Core · 10 h
- P-4.3 Stacks and Queues
Core · 8 h
- P-4.4 Hash Tables
Core · 12 h
- P-4.5 Trees and Binary Search Trees
Core · 14 h
- P-4.6 Heaps and Priority Ordering
Core · 10 h
- P-4.7 Graphs, and How to Store Them
Core · 12 h