Min-heap Program Plan: Filename: Sorting.java Import the required packages. Create a class “Sorting”: Define the main method Generate the heap and initialize the heap elements. Validate the size and the remove the elements from the heap. Filename: MinHeap.java Define the class “minHeap” Create a new array list. Create a method “MinHeap()”. Define a method “MinHeap()”. Loop that iterates to add all the elements into the heap. Define a method “add()” Add the objects into the list. Assign the current index value. Loop that validates the index value is greater than zero. Based on the requirements and condition defined swap is made on the list. Finally elements are added into the list Define the method “remove()” Validates the size of list. Initialize the remove object. Loop that iterates to validate the index value is greater the size of the list. Based on the requirements and condition defined swap is made on the list. Finally the required element is removed from the list. Define the method “getsize()” Used to return the size of the list.

Question

Want to see the full answer?

Answer 1

Question

Chapter 23, Problem 23.7PE

Program Plan Intro

Min-heap

Program Plan:

Filename: Sorting.java

Import the required packages.

Create a class “Sorting”:

Define the main method

Generate the heap and initialize the heap elements.

Validate the size and the remove the elements from the heap.

Filename: MinHeap.java

Define the class “minHeap”

Create a new array list.

Create a method “MinHeap()”.

Define a method “MinHeap()”.

Loop that iterates to add all the elements into the heap.

Define a method “add()”

Add the objects into the list.

Assign the current index value.

Loop that validates the index value is greater than zero.

Based on the requirements and condition defined swap is made on the list.

Finally elements are added into the list

Define the method “remove()”

Validates the size of list.

Initialize the remove object.

Loop that iterates to validate the index value is greater the size of the list.

Based on the requirements and condition defined swap is made on the list.

Finally the required element is removed from the list.

Define the method “getsize()”

Used to return the size of the list.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Project 4: Maze Solver (JAVA) The purpose of this assignment is to assess your ability to: Implement stack and queue abstract data types in JAVA Utilize stack and queue structures in a computational problem. For this question, implement a stack and a queue data structure. After testing the class, complete the depth-first search method (provided). The method should indicate whether or not a path was found, and, in the case that a path is found, output the sequence of coordinates from start to end. The following code and related files are provided. Carefully ready the code and documentation before beginning. A MazeCell class that models a cell in the maze. Each MazeCell object contains data for the row and column position of the cell, the next direction to check, and a bool variable that indicates whether or not the cell has already been visited. A Source file that creates the maze and calls your depth-first search method. An input file, maze.in, that may be used for testing. You…

C++ CODE PLEASE Using an array to represent the min-max heap structure , implement the following operations. (in c++ programming language) 1. buildHeap : Builds a min-max heap from a list of naturals read from standard input. 2. findMin and findMax : Returns the minimum (resp the maximum) element. 3. insertHeap : Inserts a new element into the min-max heap. 4. deleteMin and deleteMax : Deletes the minimum (resp the maximum) element. NOTE: min-max should be in one heap structure only and not separate heap structure for min and max. Only one heap for both min and max. Root should be min level, the level below root should be max level,then level after that should again be min level and so on.

(IN JAVA) In this task, a binomial heap should be implemented. A binomial heap is implemented byan array with its elements being binomial trees: on the first place there is the binomial treeB0 with one element, on the second place there is the binomial tree B1 with two elements,on the third place there is the binomial tree B2 with four elements,. . . Each binomial treeis implemented recursively using the class BinomialNode. In this class there is nothing toimplement. Methods in this class are needed for the implementation of the methods in theclass BinomialHeap. More precisely, in the class BinomialHeap you should implement thefollowing methods:(i) insert, which takes an integer (a key) and inserts it in the binomial heap. Themethod returns true, if the key is successfully inserted and false otherwise. In thecase, if the array should be resized, use the method resizeArray (see below).(ii) getMin, which returns the minimal key in binomial heap. The implementation willbe also efficient…