Data Structure Visualizer
Builds the seven data structures every computer science course revolves around — binary search tree, AVL tree, red-black tree, min-heap, hash table, trie and union-find — and animates every insert, delete and search step by step. You see AVL rotations labelled LL/LR/RL/RR as they happen, red-black recoloring and fix-up rotations, heap sift-up and sift-down, hash collisions resolved by chaining or linear probing with a live load factor and an animated rehash, trie prefix paths lighting up, and union-find trees flattening under path compression. Step forward and backward through each operation at your own pace, or let it play.
Runs 100% in your browser — nothing you paste leaves your device.
Read the full guide to this tool
Notes
- Each operation is recorded as a list of snapshots, so you can step backwards — useful when a rotation flies by too fast.
- The hash table doubles its bucket count when the load factor passes 0.75 and rehashes every key, one step at a time — the hidden cost behind "amortized O(1)".
- Union-find uses union by rank plus path compression: watch a tall tree collapse to depth 1 after a single find.
- Red-black deletion is the classic CLRS algorithm with the full double-black fix-up cases.
- Runs 100% in your browser — nothing you paste leaves your device.
Related tools
Bloom Filter Playground
Add items, watch bits light up, measure the false positive rate.
Cache Replacement Simulator
Animate FIFO, LRU, LFU, CLOCK, ARC and Bélády's OPT on any access sequence.
Consistent Hashing Ring
See why adding a server moves 1/N of the keys, not all of them.
Digital Logic Gate Simulator
Build circuits from gates and flip-flops, wire them up, and watch the signals flow live.
Git Branching Sandbox
Type git commands and watch the commit DAG, branches and HEAD move — with levels, remotes, undo, and merge-vs-rebase contrast.
IEEE-754 Floating Point Explorer
Flip the bits of a float and see why 0.1 + 0.2 ≠ 0.3.