6.9. Binary Heap OperationsΒΆ

The basic operations we will implement for our binary heap are as follows:

ActiveCode 1 demonstrates the use of some of the binary heap methods. Notice that no matter the order that we add items to the heap, the smallest is removed each time. We will now turn our attention to creating an implementation for this idea.

Next Section - 6.10. Binary Heap Implementation