We briefly reviewed big-O notation. We introduced priority queues and considered several implementation strategies.

We introuced the heap data structure: a heap is a binary tree (not a BST) satisfying:

  1. The priority at every node is larger than the priorities of its children (and therefore, recursively, of its descendants)
  2. A heap is full