1. Complete the implementation file for the class Array Max Heap. 2. Use a binary search tree in the implementation of Heap Interface . Where in the tree will the largest entry occur? How efficient is...

1. Complete the implementation file for the class Array Max Heap.

2. Use a binary search tree in the implementation of Heap Interface . Where in the tree will the largest entry occur? How efficient is this implementation?

3. Implement a class of min heaps using an array. Name your class Array Min Heap