Data Structures Roadmap
Open a topic for notes and resources. Mark it done when you are ready to move on.
Data Structures
✓
Arrays
✓
Linked Lists
✓
Foundations
✓
Stacks and Queues
✓
Hash Maps
✓
Core Concepts
✓
Binary Trees
✓
Heaps
✓
Graphs
✓
Tries
✓
Intermediate Skills
✓
Sets
✓
Segment Trees
✓
Advanced Topics
✓
B-Trees
Keep learning
Text version of this roadmap
1. Foundations
- Arrays: Contiguous memory allocation, random access, and time/space analysis for array operations.
- Linked Lists: Singly and doubly linked lists, insertion/deletion patterns, and pointer manipulation.
- Stacks and Queues: LIFO and FIFO abstractions, array and linked implementations, and standard applications.
2. Core Concepts
- Hash Maps: Hash functions, collision resolution (chaining, open addressing), load factor, and resizing.
- Binary Trees: Tree traversal (inorder/preorder/postorder), BST properties, and balanced tree concepts.
- Heaps: Binary heap, priority queue, heapify, sift-up/sift-down, and heap sort.
3. Intermediate Skills
- Graphs: Adjacency matrix/list, directed/undirected, weighted graphs, and traversal algorithms.
- Tries: Prefix tree for string search, autocomplete, and memory-efficient variants like radix trees.
- Sets: Hash set vs tree set, union/intersection/difference operations, and bit-set representations.
4. Advanced Topics
- Segment Trees: Range query and point update in O(log n), lazy propagation, and 2D segment trees.
- B-Trees: Balanced tree for disk storage, fanout, insertion/deletion algorithms, and database indexes.