Sign inSign in

Heap

A tree-based data structure satisfying the heap property, where parent nodes are ordered relative to their children.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Srini Devadas

    MIT · Undergraduate

    An implementation of a priority queue that is an array structure visualized as a nearly complete binary tree.
    • 6:13Priority Queues, Binary Heaps & O(n) Build-Max-Heap
  • Victor Costan

    MIT · Undergraduate

    A full binary tree where every internal node satisfies the heap property, meaning each node is larger than its children in a max heap.
    • 24:14Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)

Lectures that assume it

8

Connections

21

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

3 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.