title: How does Java's PriorityQueue differ from a min-heap?
body: <p>Why did they name <code>PriorityQueue</code> if you can't <strong>insertWithPriority</strong>? It seems very similar to a heap. Are there any differences? If no difference, then why was it named <code>PriorityQueue</code> and not Heap?</p>