ConceptTheory & Algos
Van Emde Boas tree
A tree-based data structure supporting predecessor queries in Θ(log log u) time using 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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine & Srini Devadas
An advanced data structure that implements an associative array with keys from a universe of size u, supporting operations like insert, delete, and successor in time.
Lectures that assume it
2Connections
13The lectures that define it or assume it, and the concepts next to it.