Are they min/max-heaps?
Exercises 4.1 and 4.2
P5: Priority Queues
This session is about (quasi-)complete trees, heaps, priority queues, and how to use them in relation to sorting.
We solve some problems from the EDA ProblemSet, section 4 Priority queues.
