Please answer the problem in the screenshot. Please use the methods below as a base. 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. 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 }
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 3PE
Related questions
Question
Please answer the problem in the screenshot. Please use the methods below as a base.
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
}
![Display Heap display: This method should print all elements in the max heap in
the order of levels (e.g., root element first, root's two children second, root's
grandchildren third, etc.). Elements on the same level should be separated with
one or two white spaces; elements on different levels should be separated with a
comma.
public void display()
Build a Heap build: This method should take an array as the only parameter and
build a heap based on the given array. Note that this method is NOT supposed to
be called if a heap is non-empty.
public void build(int[] arr)
These methods should NOT be declared as static. You are free to use any extra instances
and helper methods.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1725b614-c61a-470a-b05f-008b5304bcc7%2F43fcd55a-332d-47a2-9ab2-6298d22bdefe%2Fua9jbxc_processed.png&w=3840&q=75)
Transcribed Image Text:Display Heap display: This method should print all elements in the max heap in
the order of levels (e.g., root element first, root's two children second, root's
grandchildren third, etc.). Elements on the same level should be separated with
one or two white spaces; elements on different levels should be separated with a
comma.
public void display()
Build a Heap build: This method should take an array as the only parameter and
build a heap based on the given array. Note that this method is NOT supposed to
be called if a heap is non-empty.
public void build(int[] arr)
These methods should NOT be declared as static. You are free to use any extra instances
and helper methods.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning