Insert, delete, search, and traverse a BST, AVL tree (animated rotations with balance factors), or min-heap — every comparison narrated, every pointer move animated.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Binary Search Tree Visualizer animates insertions, deletions, searches, and all four traversals on a BST — plus AVL trees with named, animated rotations and balance factors, and a min-heap shown as array and tree simultaneously. Every comparison is narrated as the walk happens, so you see exactly why each node lands where it does.
Stacks, queues, lists, and hash tables with narrated operations.
Open toolBinary Search Tree — left < node < right. No self-balancing: insertion order alone decides the shape (a sorted insert order degrades into a linked list).
Integers from −999 to 999 · comma or space separated lists run one after another · duplicates are rejected with an explanation · cap 31 nodes so the layout stays readable.
| Structure | Insert | Delete | Search |
|---|---|---|---|
| BST | O(h)* | O(h)* | O(h)* |
| AVL | O(log n) | O(log n) | O(log n) |
| Min-heap | O(log n) | O(log n) | O(n) |
* h is the tree height: O(log n) on average, but O(n) worst case when insertions arrive sorted — exactly what AVL rotations prevent. Tree traversals are always O(n).
