ConceptTheory & Algos
Optimal binary search tree
A binary search tree structured to minimize the expected search cost for a given set of keys and access probabilities.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.