Learn
The roadmap
Eight chapters, in the order of the official outline. Go in order; each chapter uses the one before it.
💡 Don't just watch: implement it yourself, then solve 2–3 problems.
Phase 1: Foundations
Weeks 1–401
Introduction to Data Structures
What a data structure is, how we classify them, ADTs and abstraction, plus an array refresher.
Week 13 topics
02
Algorithm & Algorithm Analysis
Properties of algorithms, counting time units, best/average/worst case and asymptotic notation.
Weeks 2–35 topics
03
Simple Sorting & Searching
Selection, bubble, insertion and pointer sort; linear and binary search; a recursion primer.
Weeks 3–47 topics
Phase 1 mini-projectCombine this phase's structures in one console program.Phase 2: Linear & Hierarchical
Weeks 5–1004
Linked Lists
Pointers and the heap, then singly and doubly linked lists: insert, delete, search, traverse.
Weeks 5–63 topics
05
Stacks & Queues
LIFO and FIFO with arrays and linked lists, the circular queue, and the STL containers.
Weeks 7–86 topics
06
Trees
Binary trees and BSTs: insert, search, delete, traversals, and general trees.
Weeks 9–105 topics
Phase 2 mini-projectCombine this phase's structures in one console program.