Domain

Core Data Structures

The building blocks behind every library collection: arrays, lists, trees, heaps, hash tables, tries, and union-find — how they work, not just how to call them.

1. Arrays & Linked Lists
2. Stacks & Queues
3. Trees & Traversals
4. Binary Search Trees
5. Balanced Trees
6. Heaps & Priority Queues
7. Hash Tables
8. Tries
9. Union-Find
10. Graph Representations