Core Data Structures
A 21-module path through core data structures, in study order from foundations to the frontier.
Modules
- Arrays and Dynamic Arrays
- Linked Lists
- Stacks
- Queues and Deques
- Hash Functions
- Hash Tables and Direct Addressing
- Separate Chaining Collision Resolution
- Open Addressing Collision Resolution
- Binary Trees
- Tree Traversals
- Binary Search Trees
- AVL Trees
- Red-Black Trees
- B-Trees
- Priority Queues
- Tries
- Disjoint-Set Union-Find
- Skip Lists
- Amortized Analysis
- Augmenting Data Structures
- Choosing a Data Structure