$ run --tool
Binary Search Tree Visualizer
Insert, search and traverse a binary search tree, watching comparisons and the tree shape update step by step.
Tree is empty — insert a value to begin
Features
- ✓Insert with step-by-step comparison-and-placement animation
- ✓Search with traversal highlighting
- ✓Inorder, Preorder, Postorder and Level-order traversals
- ✓Automatic, non-overlapping tree layout for any shape
How to use
- 1Insert values one at a time, or generate a random tree
- 2Run Search or any of the 4 traversals
- 3Step through with Next/Prev or Play to follow the comparisons
Frequently asked questions
Does it rebalance the tree?+
No — this is a plain (unbalanced) binary search tree, matching how it's usually taught before self-balancing trees like AVL or Red-Black.
Can I delete a node?+
Not yet — insert, search and the 4 traversals are covered first; deletion may be added later.
Related tools
education
DSA Visualizer — Arrays, Stacks, Queues & Complexity
Watch sorting, searching, array operations, stack/queue operations run step by step, plus a full time-complexity reference.
education
Linked List Visualizer
Insert, delete, search and reverse a singly linked list, watching each node and pointer update step by step.
Need a tool that isn't here yet?
ToolsForce is growing every week. Tell us what to build next.
Request a tool