Binary Search Trees — Interactive

Insert values to build a BST. Search to trace the comparison path. Compare balanced vs degenerate trees.

Insert

Value

Presets

Speed: Normal

Nodes

Height

—

Min possible

—

Last search

Try it: Load "Balanced" then search for 30. Then load "Degenerate" and search for 70. Same 7 nodes — very different search costs!

Log

Node

Visiting

Found / Inserted

Not found