Sign inSign in

Data structure augmentation

Maintaining extra information at every node of a data structure to support additional queries or properties efficiently during operations.
as Erik Demaine defines itMITThe wording closest to all 3 definitions
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.

Data structure22-3 Trees1AVL tree1Balanced search trees1Binary search tree1Computational complexity1Tree data structures1

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    • 0:25Augmentation: Range Trees
  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

    Adding extra information to a data structure to make common operations faster.
    • 10:51Bentley Rules for Optimizing Work

Connections

6

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

Concepts3

Lectures3

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.