title: Java PriorityQueue returning the least element as first
body: <p>The javadoc for PriorityQueue in Java says:
  The head of this queue is the least element with respect to the specified ordering.</p>
  
  <p>Does anyone know if this class was intended to be used as heap or just happened to conveniently fit the heap description? 
  And if it was supposed to be a heap, then I'm confused as to why they chose to pick 'least' element to be returned by remove() - why would 'least' element have the most priority or be like 'biggest' or 'oldest' element used in heap?</p>
  
  <p>Thanks in advance</p>