Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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 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 }

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

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

}

 

 

The task for this part is to implement max heap as a class in java. The class should be named "HeapMax"; in other words, the file name for this class would be "HeapMax.java". The max heap will have the following methods as: Constructor HeapMax: The constructor method should initialize the data storage for your data structure. You need to deal with the scenario when the storage is full if you use arrays or data structures that have inflexible sizes in other methods (e.g., insert). public HeapMax(O already finished for you ---- Insertion insert: This method inserts a new element to the max heap. You need to think about the scenario when a user tries to insert more elements than the original designated size (if you decide to implement the heap using array class). public void insert(int element) Get Max getMax: This method returns the root element of the max heap. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int getMax() Remove Max removeMax: This method removes and returns the root element of the max heap, and reorganize the heap accordingly to restore its max heap characteristics. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int removeMax()
Transcribed Image Text:The task for this part is to implement max heap as a class in java. The class should be named "HeapMax"; in other words, the file name for this class would be "HeapMax.java". The max heap will have the following methods as: Constructor HeapMax: The constructor method should initialize the data storage for your data structure. You need to deal with the scenario when the storage is full if you use arrays or data structures that have inflexible sizes in other methods (e.g., insert). public HeapMax(O already finished for you ---- Insertion insert: This method inserts a new element to the max heap. You need to think about the scenario when a user tries to insert more elements than the original designated size (if you decide to implement the heap using array class). public void insert(int element) Get Max getMax: This method returns the root element of the max heap. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int getMax() Remove Max removeMax: This method removes and returns the root element of the max heap, and reorganize the heap accordingly to restore its max heap characteristics. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int removeMax()
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.
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Array
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.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS