Core Data Structures, Visualized

This is the largest topic in the curriculum, and the one where visualization pays off most. Pointer manipulation in a linked list, rotation in an AVL tree, relaxation in Dijkstra’s algorithm — these are all fundamentally spatial operations that textbooks are forced to render as prose.

The lessons run from the linear structures through trees and their balancing schemes to graphs and the traversal and shortest-path algorithms built on them. Together they cover the structures that the majority of interview questions are posed in terms of, and each one is something you can manipulate rather than only read about.