package uk.ac.cam.cl.tester.Algorithms; // Do not modify this line!

public interface MaxHeapInterface< T extends Comparable<T> > {
       // insert a new value into the heap
       public void insert(T e);
       // get and remove the maximum value (or thrown an exception if empty)	
       public T popMax() throws EmptyHeapException;
       // get the number of items in the heap
       public int getLength();
}