/**
 * Heap
 */
public class Heap
{

	/**
     * public boolean empty()
     *
     * precondition: none
     * 
     * The method returns true if and only if the heap
     * is empty.
     *   
     */
	public boolean empty(){
    	return false; // should be replaced by student code
    }
		
	/**
     * public int getHeapsize()
     *
     * precondition: none
     * 
     * The method returns the number of elements in the 
     * heap.
     *   
     */
	public int getHeapsize(){
    	return 42; // should be replaced by student code
    }
    
	/**
     * public boolean isHeap()
     *
     * precondition: none
     * 
     * The method returns true if and only if the heap
     * satisfies the heap property or heapsize==0.
     *   
     */
    public boolean isHeap() 
    {
    	return false; // should be replaced by student code
    }

    /**
    * public void insert(int value)
    *
    * precondition: value >= 0
    *               isHeap()
    * 
    * postcondition: isHeap()
    */
    public void insert(int value) 
    {    
    	return; // should be replaced by student code
    }

    /**
    * public void deleteMin(int[] a, int heapsize)
    *
    * precondition: heapsize >= 1
    *               isHeap()
    * 
    * postcondition: isHeap()
    */
    public void deleteMin()
    {
     	return; // should be replaced by student code
     	
    }

    /**
     * public int getMin()
     *
     * precondition: heapsize >= 1
     *               isHeap()
     * 
     * postcondition: isHeap()
     */
    public int getMin()
    {
    	return 42;// should be replaced by student code
    } 
    
    /**
     * public void meld (Heap heap2)
     *
     * precondition: isHeap()
     * 				 heap2.isHeap()
     * 
     * postcondition: isHeap()
     * 				  heap2.getHeapsize=0;
     * 
     */
    public void meld (Heap heap2)
    {
    	  return; // should be replaced by student code   		
    }
    
    /**
    * public boolean contains(int i)
    *
    * precondition: isHeap()
    * 
    * The method returns true if and only if the heap
    * contains an element of value i.
    *   
    */
	public boolean contains(int i){
		return false; // should be replaced by student code
    }
	
    /**
     * public class HeapNode
     * 
     * If you wish to implement classes other than HeapTree
     * (for example HeapNode), do it in this file, not in 
     * another file 
     *  
     */
    public class HeapNode{
  	
    }

}