ConceptTheory & Algos
Predecessor problem
The problem of maintaining a set of elements to support insert, delete, predecessor, and successor queries.
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
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.
Lectures that assume it
3Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Binary search tree
- Asymptotic notation
- Data structure
- Colored predecessor
- Colored predecessor problem
- Fusion trees