class java.util.PriorityQueue

  
   boolean isEmpty();
  
   boolean add(E x); // adds element
  
    E remove();    // removes and returns smallest (highest priority) item
 
   E peek();     // returns highest priority item without removing it
}