(Solved Homework): Build a Max heap on the array containing (in this order) A[] = {5, 5, 20, 64, 17, 10, 25, 19}. Show the heap after the last two calls to MaxHeap…

import java.io.*;

public class JavaMaxHeapExample {

private int[] Heap;

private int size;

private int maxsize;

private static final int FRONT = 1;

public JavaMaxHeapExample(int maxsize) {

this.maxsize = maxsize;

this.size = 0;

Heap = new int[this.maxsize + 1];

Heap[0] = Integer.MAX_VALUE;

}

private int parent(int pos) {

return pos / 2;

}

private int leftChild(int pos) {

return (2 * pos);

}

private int rightChild(int pos) {

return (2 * pos) + 1;

}

private boolean isLeaf(int pos) {

if (pos >= (size / 2) && pos <= size) {

return true;

}

return false;

}

private void swap(int fpos, int spos) {

int tmp;

tmp = Heap[fpos];

Heap[fpos] = Heap[spos];

Heap[spos] = tmp;

}

private void maxHeapify(int pos) {

if (!isLeaf(pos)) {

if (Heap[pos] < Heap[leftChild(pos)] || Heap[pos] < Heap[rightChild(pos)]) {

if (Heap[leftChild(pos)] > Heap[rightChild(pos)]) {

swap(pos, leftChild(pos));

maxHeapify(leftChild(pos));

} else {

swap(pos, rightChild(pos));

maxHeapify(rightChild(pos));

}

}

}

}

public void insert(int element) {

Heap[++size] = element;

int current = size;

while (Heap[current] > Heap[parent(current)]) {

swap(current, parent(current));

current = parent(current);

}

}

public void printHeap() {

for (int i = 1; i <= size / 2; i++) {

System.out.print(

” PARENT : ” + Heap[i] + ” LEFT CHILD : ” + Heap[2 * i] + ” RIGHT CHILD :” + Heap[2 * i + 1]);

System.out.println();

}

}

public void print() {

System.out.print(“Max Heap: “);

for (int i = 1; i <= size; i++) {

System.out.print(Heap[i] + ” “);

}

System.out.println();

}

public void maxHeap() {

for (int pos = (size / 2); pos >= 1; pos–) {

maxHeapify(pos);

}

}

public int remove() {

int popped = Heap[FRONT];

Heap[FRONT] = Heap[size–];

maxHeapify(FRONT);

return popped;

}

public static void main(String[] args) {

JavaMaxHeapExample maxHeap = new JavaMaxHeapExample(15);

maxHeap.insert(5);

maxHeap.insert(5);

maxHeap.insert(20);

maxHeap.insert(64);

maxHeap.insert(17);

maxHeap.insert(10);

maxHeap.insert(25);

maxHeap.maxHeap();

maxHeap.print();

maxHeap.insert(19);

maxHeap.maxHeap();

maxHeap.print();

}

}