Please answer the problem in the screenshot. Please use the methods below as a base. The language is in Java. import java.util.*; class HeapMax { // we go with arraylist instead of array for size flexibility private ArrayList data; // DO NOT MODIFY THIS METHOD public HeapMax() { data = new ArrayList(0); } // insert a new element and restore max heap property public void insert(int element) { } // return max public int getMax() { // remove this line return 0; } // remove max and restore max heap property public int removeMax() { // remove this line return 0; } // heap builder public void build(int[] arr) { } // print out heap as instructed in the handout public void display() { } // you are welcome to add any supporting methods }
Please answer the problem in the screenshot. Please use the methods below as a base. The language is in Java.
import java.util.*;
class HeapMax {
// we go with arraylist instead of array for size flexibility
private ArrayList<Integer> data;
// DO NOT MODIFY THIS METHOD
public HeapMax() {
data = new ArrayList<Integer>(0);
}
// insert a new element and restore max heap property
public void insert(int element) {
}
// return max
public int getMax() {
// remove this line
return 0;
}
// remove max and restore max heap property
public int removeMax() {
// remove this line
return 0;
}
// heap builder
public void build(int[] arr) {
}
// print out heap as instructed in the handout
public void display() {
}
// you are welcome to add any supporting methods
}
Trending now
This is a popular solution!
Step by step
Solved in 6 steps with 4 images