⚡ AlgoZen_
~/home/trees_&_bst/binary_search_tree1 / 3

Binary Search Tree

Intermediate

A tree where each node's left subtree contains only smaller values and right subtree only larger values. Enables O(log n) search, insert, and delete.

time:O(log n) avg
space:O(n)
⚡ +200_XP
step[1/25]
> Insert
Building tree...
Inserting 50 into the BST.

// tap NEXT STEP to walk through one step at a time