No operations yet...
Binary Search Tree — each node has at most 2 children. Left child is always smaller, right is always larger.
Drag to insert, type a number and hit Delete to remove. Search highlights the found node in gold.
InsertO(log n) avg
SearchO(log n) avg
DeleteO(log n) avg
account_tree
Empty Tree — Insert a number