31251 Lecture 7.3: Implementation of a binary heap

We discuss how a binary heap can be represented with a vector, and go over the implementation of the insert and remove_min operations. We also discuss the complexity of these operations.