code: public boolean offer(T element) {
  		if (size < capacity) {
  			put(element);
  			return true;
  		} else if (size > 0 && !lessThan(element, peek())) {
  			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
  The element to insert,
  @return True, if element is added, false otherwise.