We will define our binary min-heap as being complete and obeying min-heap property: Modifying its structure and the constraints, we can further improve the runtime and efficiency of these operations. We previously saw that our known data structures with the best runtime for our PQ operations was the binary search tree.
Exceptions, Iterators, Iterables, Object MethodsĬhecked vs.
4.2 Extends, Casting, Higher Order FunctionsĦ.
