Binary Search Tree ·
Insert & Traverse
O(log n) · insert · search · traverse
nodes
0
height
0
traversed
0
operation
—
node (key value)
current path during insert
in-order traversal highlight
Play
Pause
Reset