title: Java implementation for Min-Max Heap?
body: <p>Do you know of a popular library (Apache, Google, etc, collections) which has a reliable Java implementation for a min-max heap, that is a heap which allows to peek its minimum and maximum value in <code>O(1)</code> and to remove an element in <code>O(log n)</code>?</p>