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: