Sign inSign in

Splay tree

A self-adjusting binary search tree with the property that recently accessed elements are quick to access again.
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

    • 29:03Dynamic 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.