Sign inSign in

Van Emde Boas tree

A tree-based data structure supporting predecessor queries in Θ(log log u) time using Θ(u)\Theta(u) space.
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    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 O(log⁡log⁡u)O(\log \log u) time.
    • 0:30Divide & Conquer: Van Emde Boas Trees

Lectures that assume it

2

Connections

13

The lectures that define it or assume it, and the concepts next to it.

Concepts9

Show 3 more

Lectures4

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.