Binary Search Tree Monster
Insert, search, traverse — BST with in-order, pre-order, post-order visualization and challenge mode.
5
Nodes
3
Tree Height
0
Comparisons
—
Balanced?
BST INSERT MODE
Traversal Result
Run a traversal to see order
Operation Log
Insert node values to trace BST path traversal.
Challenge Mode
0
Predict the in-order traversal result to earn points!
Time Complexity
Insert (Avg)
O(log n)
Insert (Worst)
O(n)
Search (Avg)
O(log n)
Delete (Avg)
O(log n)
Traversal
O(n)
BST Rules
Left child
< Parent Right child
> Parent
In-Order: Left → Root → Right → sorted!
Pre-Order: Root → Left → Right
Post-Order: Left → Right → Root