Question

java

The following code is an implementation of a HeapPriorityQueue. You are to implement the methods commented with: // TODO: TIP: Do not just go from memory of your assignment implementation, be sure to consider carefully the constructor and method implementation provided to you. NOTE: You do not have to provide an implementation for any methods intentionally omitted public class Heap PriorityQueue implements PriorityQueue private final static int DEFAULT SIZE 10000 private Comparable [ ] storage private int currentSize: public HeapPriorityQueue ) this (DEFAULT SIZE); public HeapPriorityQueue int size) storage new Comparable [ size + 11: currentSize 0; throws Heap Ful l Except ion public void insert Comparable k if currentSize storage.length) throw new Heap Full Exception () ; currentSize++; storage [currentSize] k bubbleUp (currentSize) private void bubbleUp ( int index ) // implementation omitted intentionally /DO NOT implement private void swapElement (int posl, int pos2) // implementation omitted intentionally //DO NOT implement private boolean hasLeft (int pos) return (leftChild (pos) <currentSize); private boolean hasRight ( int pos ){ return rightChild (pos) <currentSize) ; //continued on the following page...

Answer 1

package HeapPriorityQueue;

import java.util.PriorityQueue;

public class HeapPriorityQueue extends PriorityQueue {
  
private final static int DEFAULT_SIZE=10000;
private Comparable[] storage;
private int currentSize;
  
public HeapPriorityQueue(){
this(DEFAULT_SIZE);
}
  
  
public HeapPriorityQueue(int size){
storage = new Comparable[size+1];
currentSize = 0;
}
  
public void insert(Comparable k)throws HeapFullException{
if(currentSize == storage.length)
throw new HeapFullException();
storage[currentSize]= k;
currentSize++;
bubbleUp(currentSize);
}
  
public void bubbleUp(int index){
//Not req
}
public void swapElement(int pos1,int pos2){
//Not req
}
  
public boolean hasLeft(int pos)
{
return (leftChild(pos)<= currentSize);
}
  
  
public boolean hasRight(int pos)
{
return (rightChild(pos)<= currentSize);
}
  
private int parent(int pos){
// Parent of any heap array is index/2 if index is not root element other wise root has no parent
return (pos/2);
}
  
private int leftChild(int pos){
return pos*2;// Left Child in array is always in order
}
  
private int rightChild(int pos){
return pos*2+1;
}
}

package HeapPriorityQueue;
public class HeapFullException extends Exception {
public HeapFullException()
{
super("Heap is full.");
}
}