Binary Heap (MinHeap)

A Binary Heap is a binary tree that exhibits the heap property, either as a minimum heap (smallest value at the top of each binary tree) or a maximum heap (largest value at the top of each binary tree).

Write a program binary_heap.py that defines a BinaryHeap class as a Minimum Heap.

In general a Binary Heap needs the following methods:

• BinaryHeap() constructs a new empty binary heap
• insert(value) places a new value in the binary heap in an appropriate location
• find_min() (for a MinHeap implementation) returns the minimum value in the heap, but doesn't remove it
• del_min() (for a MinHeap implementation) returns the minimum value in the heap and removes it from the heap
• is_empty() returns True or False depending on the state of the heap
• size() returns the number of elements in the heap
• build_heap(value_list) creates a new heap from the given list of values

The primary challenges with this assignment include:

• How do we add a new node to our heap so that it is located at a valid heap location?
• How do we adjust our heap so that it is still valid after we remove an item at the top of the heap?
• Given a pre-existing list of values, how do we efficiently assemble them into a heap?

Your program should include the BinaryHeap class declaration as well as a main() program that demonstrates the use of the class to create a minimum heap.