ConceptTheory & Algos
Dynamic optimality
The study of whether a binary search tree algorithm can be within a constant factor of the optimal offline BST for any given access sequence.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Connections
8The lectures that define it or assume it, and the concepts next to it.