The Binary Search Tree
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
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.
Show
An atlas index arranged this way finds any place-name by branching left or right at each letter.
Watch for
The ordering property is what earns the speed.