code: public boolean insert(T element){
      if (size < maxSize){
        put(element);
        return true;
      }
      else if (size > 0 && !lessThan(element, top())){
        heap[1] = element;
        adjustTop();
        return true;
      }
      else
        return false;
    }
docs: Adds element to the PriorityQueue in log(size) time if either
  the PriorityQueue is not full, or not lessThan(element, top()).
  @param element
  @return true if element is added, false otherwise.