Sign inSign in

Dynamic optimality

The study of whether a binary search tree algorithm can be within a constant factor of the optimal offline BST for any given access sequence.
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

1
  • Erik Demaine

    MIT · Graduate

    • 0:28Dynamic Optimality I

Connections

8

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

Concepts6

Lectures2

1 lecturer. 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.