void delFront(); // Remove the "next" item from the heap, however "next" // is defined... in this assignment our implementing class // will be a minimum binary heap so this method will remove // the item with the smallest priority value. // // Error: If the heap is empty there is nothing to remove so // simply return in this case... do nothing //Min-heap example: // Suppose we have the following min-heap: // 2, 3, 4, 16, 7, 11, 9, 31, 18, 21, 12 // After calling delFront(), the min-heap now looks as follows: // 3, 7, 4, 16, 12, 11, 9, 31, 18, 21 public int getFront() throws IllegalStateException { //Return the element at the front (i.e., the smallest) element in the min-heap. //If the min-heap has no elements, throw an IllegalStateException. /*Your code here */ throw new IllegalStateException(); //Dummy return statement. Remove (or move elsewhere) when you implement! } Solve for this method in java language Class info below public class MinHeap implements Heap { private int size = 0; // number of elements currently in the heap private int[] elts; // heap array private int max; // array declared size // ================================================ // constructors // ================================================ public MinHeap(int umax) { // user defined heap size this.max = umax; this.elts = new int[umax]; } public MinHeap( ) { // default heap size is 100 this.max = 100; this.elts = new int[100]; }
void delFront();
// Remove the "next" item from the heap, however "next"
// is defined... in this assignment our implementing class
// will be a minimum binary heap so this method will remove
// the item with the smallest priority value.
//
// Error: If the heap is empty there is nothing to remove so
// simply return in this case... do nothing
//Min-heap example:
// Suppose we have the following min-heap:
// 2, 3, 4, 16, 7, 11, 9, 31, 18, 21, 12
// After calling delFront(), the min-heap now looks as follows:
// 3, 7, 4, 16, 12, 11, 9, 31, 18, 21
public int getFront() throws IllegalStateException {
//Return the element at the front (i.e., the smallest) element in the min-heap.
//If the min-heap has no elements, throw an IllegalStateException.
/*Your code here */
throw new IllegalStateException(); //Dummy return statement. Remove (or move elsewhere) when you implement!
}
Solve for this method in java language
Class info below
public class MinHeap implements Heap {
private int size = 0; // number of elements currently in the heap
private int[] elts; // heap array
private int max; // array declared size
// ================================================
// constructors
// ================================================
public MinHeap(int umax) { // user defined heap size
this.max = umax;
this.elts = new int[umax];
}
public MinHeap( ) { // default heap size is 100
this.max = 100;
this.elts = new int[100];
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
