Sign inSign in

Predecessor problem

The problem of maintaining a set of elements to support insert, delete, predecessor, and successor queries.
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

    The problem of maintaining a set of elements and efficiently finding the largest element in the set that is smaller than or equal to a given query value.
    • 1:21Divide & Conquer: Van Emde Boas Trees

Lectures that assume it

3

Connections

13

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

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.