import java.util.Comparator;
import java.util.ArrayList;

/**
 * An implementation of Priority Queues using heaps
 */
public class Heap<T>
  implements PriorityQueue<T>
{
  // +--------+------------------------------------------------------
  // | Fields |
  // +--------+

  /**
   * The comparator used for the ordering.
   */
  Comparator<T> compare;

  /**
   * The array that stores the valules.
   */
  ArrayList<T> values;

  /**
   * The number of values stored.
   */
  int size;

  // +--------------+------------------------------------------------
  // | Constructors |
  // +--------------+

  public Heap(Comparator<T> compare) {
    this.compare = compare;
    this.values = new ArrayList<T>();
  } // Heap(Comparator<T>)

  // +---------+-----------------------------------------------------
  // | Methods |
  // +---------+

  /**
   * Add an element to the priority queue.
   */
  public void add(T val) 
    throws CollectionFullException
  {
    // STUB
  } // add(T)

  /**
   * Remove and return the highest priority element from the priority queue.
   */
  public T remove() 
    throws CollectionEmptyException
  {
    return null; // STUB
  } // remove()

  /**
   * Get the highest priority element from the priority queue without
   * removing the element.
   */
  public T peek() 
    throws CollectionEmptyException
  {
    return null; // STUB
  } // peek()

  /**
   * Determine if the collection is empty.
   */
  public boolean isEmpty()
  {
    return this.size == 0;
  } // isEmpty()

} // class Heap<T>