Computer Science / Unit 3 CS 0107 short lesson, about 20 seconds
The Binary Search Tree
Captions available
The idea
A binary search tree adds two properties: at most two children per node, and elements ordered least-to-greatest left to right — read across, the tree is sorted.
In practice
An atlas index arranged this way finds any place-name by branching left or right at each letter.
Where people slip
The ordering property is what earns the speed.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Something wrong in this lesson? Flag it · Sources for Computer Science