Skip to content
World 5 · Algorithms Visualized · 10 min · PRO

Build the shortest search tree

Insertion order decides a binary search tree’s height

PRO · Logic Gates

World 5: Algorithms Visualized is part of PRO

The first world of Logic Gates is free. PRO opens the other 29 lessons in 4 worlds — simulations, quizzes and all.

  • Sorting race: insertion vs merge
  • Shortest path: BFS vs DFS
  • From gates to a CPU: run 3 + 4
PRO includes
  • All 26 labs — every world, every lesson
  • Practice exams and certificates

$8.33/mo, billed yearly ($99.99) · or $39.99 monthly

Unlock Logic GatesTry the free world
← Shortest path: BFS vs DFSFrom gates to a CPU: run 3 + 4 →

Report a mistake

What is wrong?
0 / 2000 · at least 10 characters
Sent along with your report
  • Page
  • About Build the shortest search tree — Logic Gates · logicgates/algo-bst-short
Plus your browser type. Reports go to our support system; see the privacy notice.