Animate separate chaining — each bucket holds a linked list. Watch keys hash to slots and chains grow as collisions occur.
Watch primary clustering emerge as keys pile into contiguous runs. Each insertion shows probe count and highlights the growing cluster.
Demonstrates why prime table sizes matter in quadratic probing — compare successful vs cycling probe sequences side by side.
Animate a single key insertion into a BST — trace the comparison path and watch the new node land in the correct position.
Same 7 values, three different insertion orders. See how order determines tree height and balance — from perfectly balanced to fully degenerate.
Interactive BST search — enter a value and watch the algorithm traverse the tree, highlighting comparisons and the search path in real time.
Covers BST deletion for leaf nodes and nodes with one child — the two simpler cases before introducing successor-based deletion.
The hardest deletion case — node with two children. Demonstrates finding the in-order successor, copying its value, and unlinking it from the right subtree.
A deliberately broken BST with three violations. Step through each one — too many children, wrong subtree placement — and watch them get fixed.
Animate all three DFS traversal orders on the same tree. Switch between tabs and watch the visit sequence change with the order.
Visualizes breadth-first level-order traversal using a deque, with side-by-side Python code showing how the algorithm maps to the animation.
Explore all four AVL rotation types — LL, RR, LR, RL. Each shows the imbalance condition, the rotation steps, and the resulting balanced tree.
Build a heap from a random array or insert individual values. Toggle between max and min heap and watch sift-up percolation after each insert.
Isolates the two fundamental heap repair operations. Reheap-up restores the heap after an insert; reheap-down restores it after removing the root.
The same heap shown as both a tree and a flat array. Click any node or cell to see the parent/left/right index formulas solved live.