import java.util.*;

public class MyPriorityQueueDemo {

    public static void main(String[] args) {

	int array[] = {14, 56, 12, 32, 37, 75, 17, 79};

	MyPriorityQueue q = new MyBinaryHeap();

	System.out.print("enqueue:");
	for (int i = 0; i < array.length; i++) {
	    int item = array[i];
	    System.out.print(" " + item);
	    q.add(new Integer(item));
	}
	System.out.println(" (" + q.size() + ")");

	/*
	  System.out.print("queue:  ");
	  for (Enumeration e = q.elements(); e.hasMoreElements();) {
          System.out.print(" " + e.nextElement());
	  }
	  System.out.println(" (" + q.size() + ")");
	*/

	System.out.print("deleting 37");
	q.delete(new Integer(37));
	System.out.println(" (" + q.size() + ")");

	System.out.print("deleting 37");
	q.delete(new Integer(37));
	System.out.println(" (" + q.size() + ")");
    
	System.out.print("dequeue:");
	while (!q.isEmpty()) {
	    System.out.print(" " + q.remove());
	}
	System.out.println(" (" + q.size() + ")");
    }
}