Due Friday 12 November
In this assignment you will build an implementation of a heap based on a linked tree data structure. You will use this implementation to sort a set of random integers.
In the next assignment, we will transform your implementation into a generic ADT and use it to sort a file.
Here are the pieces you will need to assemble:
The end result should be two class definitions, Heap and Sorter. Sorter will contain main and will use a Heap object to store and sort the integers.