Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Listing 23.9 public class Heap > { private java.util.ArrayList list = new java.util.ArrayList(); /** Create a default heap */ public Heap() { } /** Create

image text in transcribed

Listing 23.9 public class Heap> { private java.util.ArrayList list = new java.util.ArrayList(); /** Create a default heap */ public Heap() { } /** Create a heap from an array of objects */ public Heap(E[] objects) { for (int i = 0; i  0) { int parentIndex = (currentIndex - 1) / 2; // Swap if the current object is greater than its parent if (list.get(currentIndex).compareTo( list.get(parentIndex)) > 0) { E temp = list.get(currentIndex); list.set(currentIndex, list.get(parentIndex)); list.set(parentIndex, temp); } else break; // the tree is a heap now currentIndex = parentIndex; } } /** Remove the root from the heap */ public E remove() { if (list.size() == 0) return null; E removedObject = list.get(0); list.set(0, list.get(list.size() - 1)); list.remove(list.size() - 1); int currentIndex = 0; while (currentIndex = list.size()) break; // The tree is a heap int maxIndex = leftChildIndex; if (rightChildIndex   (Min-heap) The heap presented in the text is also known as a max-heap, in which each node is greater than or equal to any of its children. A min-heap is a heap in which each node is less than or equal to any of its children Min-heaps are often used to implement priority queues. Revise the Heap class in Listing 23.9 to implement a min-heap Write a program to test the Min-heap. The main method will Create an array of Integers that contains the Integers 1 through 9, in unsorted order and print out the values in the array Create a Min-heap from this array of unsorted Integers and print out the values by repeatedly removing the root Integer from the Min-heap and printing out its value Create a Min-heap of Strings that contains Strings in unsorted order and print out the values in the array Create a Min-heap from this array of unsorted Strings and print out the values by repeatedly removing the root String from the Min-heap and printing out its value 1. 2. 3. 4. Your output should match the sample below: Unsorted Integers in the array: 8 9 2 3 415 6 7 Sorted Integers: 1 234 5678 9 Unsorted Strings in the array: Computer Science Rocks Sorted Strings: Computer Rocks Science

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Machine Performance Modeling Methodologies And Evaluation Strategies Lncs 257

Authors: Francesca Cesarini ,Silvio Salza

1st Edition

3540179429, 978-3540179429

More Books

Students also viewed these Databases questions

Question

Communicate with diverse populations.

Answered: 1 week ago