The following is the information on class HeapMax that will appear in the problem in the screenshot. Your task for this part is to implement max heap as a class in java. Your class should be named “HeapMax”; in other words, the file name for this class would be “HeapMax.java”. Your 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() ---- 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.

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

Related questions

Question

The following is the information on class HeapMax that will appear in the problem in the screenshot.

Your task for this part is to implement max heap as a class in java. Your class should be named “HeapMax”; in other words, the file name for this class would be “HeapMax.java”. Your 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() ---- 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.

Please use the methods below to answer the problem.

public class HeapMaxTest{

public static void main(String[] args) {

// test one

System.out.println("Testing of HeapMax starts.");

HeapMax h = new HeapMax();

int[] arr = {5, 6, 3, 4};

for (int num : arr) {

h.insert(num);

h.display();

}

h.removeMax();

h.display();

System.out.println("Testing of HeapMax ends.");

// test two

// test three

}

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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.