ConceptTheory & Algos
Y-fast tree
A data structure combining hashing and balanced binary search trees to achieve predecessor query time with high probability using linear space.
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
3The lectures that define it or assume it, and the concepts next to it.