Binary Search Tree
Run and inspect insert, delete, find, DFS, BFS, and traversal algorithms step by step.
- Interactive execution controls
- Preset trees and custom values
- Canvas pan, zoom, and layout tuning
Visualization Catalog
Choose What You Want To Explore
Start with Binary Search Tree algorithms. This catalog will grow as new visualizers are added.
Union-Find (DSU)
Visualize union by rank and path compression on disjoint sets.
- Union and find operations
- Connected checks and random unions
- Live parent/rank/set-size state
Graph Traversals
BFS/DFS visualizations for directed and undirected graphs with path highlighting.
Heap Operations
Min-heap and max-heap insert/extract animations with array and tree dual view.