/**
 * LazyHeap
 *
 * An implementation of lazy binomial heap over non-negative integers.
 * Based on exercise from previous semester.
 */
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 void insert(int value)
    *
    * Insert value into the heap 
    *
    */
    public void insert(int value) 
    {    
    	return; // should be replaced by student code
    }

   /**
    * public void deleteMin()
    *
    * Delete the minimum value
    *
    */
    public void deleteMin()
    {
     	return; // should be replaced by student code
     	
    }

   /**
    * public int findMin()
    *
    * Return the minimum value
    *
    */
    public int findMin()
    {
    	return 42;// should be replaced by student code
    } 
    
   /**
    * public void meld (Heap heap2)
    *
    * Meld the heap with heap2
    *
    */
    public void meld (Heap heap2)
    {
    	  return; // should be replaced by student code   		
    }

   /**
    * public int size()
    *
    * Return the number of elements in the heap
    *   
    */
    public int size()
    {
    	return 42; // should be replaced by student code
    }
    
   /**
    * public int[] treesSize()
    *
    * Return an array containing the sizes of the trees that represent the heap
    * in ascending order.
    * 
    */
    public int[] treesSize()
    {
        int[] arr = new int[42]; //
        return arr; //	 to be replaced by student code
    }

   /**
    * public boolean isHeap()
    *
    * Returns true if and only if the heap is valid.
    *   
    */
    public boolean isHeap() 
    {
    	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{
  	
    }

}