Data structures & algorithms, one visual step at a time.
A free study roadmap that follows your instructor's outline, at exam depth and never deeper. Animations synced to C++, exam lenses, quizzes and three labs. Your progress stays in this browser.
- chapters
- 8
- chapters
- topics
- 38
- topics
- weeks
- ~16
- weeks
- sign-ups
- 0
- sign-ups
The rule: Don't just watch: implement it yourself, then solve 2–3 problems.
Every topic, the same loop
About 26 hours of guided study across 38 topics. Each page has the same order, so you always know where you are.
- 01Watch it move
Step through every algorithm with the code line lit up as it runs.
- 02Read real C++
Every snippet compiles with g++ -std=c++17 and shows its output.
- 03Check yourself
Quick quizzes, exam-style questions and the classic mistakes.
- 04Prove it
Trace by hand, implement it, solve 2–3 problems, tick "I can…".
The 16-week plan
Short on time? Stretch the plan. Don't skip chapters: each one builds on the last.
Phase 1: Foundations
Weeks 1–4What a data structure is, how we classify them, ADTs and abstraction, plus an array refresher.
Properties of algorithms, counting time units, best/average/worst case and asymptotic notation.
Selection, bubble, insertion and pointer sort; linear and binary search; a recursion primer.
Phase 2: Linear & Hierarchical
Weeks 5–10Pointers and the heap, then singly and doubly linked lists: insert, delete, search, traverse.
LIFO and FIFO with arrays and linked lists, the circular queue, and the STL containers.
Binary trees and BSTs: insert, search, delete, traversals, and general trees.
Phase 3: Graphs, Fast Sorts & Exam Prep
Weeks 11–16A random timed quiz across the chapters you choose.
One printable page per chapter, plus the master Big-O table.
Interview patterns built on the course. Optional.