ABSTRACT
Strengths: The binary heap makes efficient usage of space, especially if the number of elements to be held in the priority queue is known when the heap is allocated. The binary heap offers locators that track elements regardless of what mutations are made.
