ConceptTheory & Algos
Heap
A tree-based data structure satisfying the heap property, where parent nodes are ordered relative to their children.
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
3Each in their own terms, from the easiest level.
Srini Devadas
An implementation of a priority queue that is an array structure visualized as a nearly complete binary tree.Victor Costan
A full binary tree where every internal node satisfies the heap property, meaning each node is larger than its children in a max heap.
Lectures that assume it
8Connections
21The lectures that define it or assume it, and the concepts next to it.