Binary search trees: how they find a value

A dictionary finds a key fast, but it does not keep keys in sorted order. A list can be sorted, but inserting into the middle is slow. A binary search tree (BST) aims for both: it keeps values in order and lets you find, add or remove values quickly, as long as the tree stays reasonably balanced.