<h1 id='intervalheap-h'>intervalheap.h</h1>
<p>An interval heap is a specialized heap with:</p>

<ul>
<li>O(1) - Find Min</li>
<li>O(1) - Find Max</li>
<li>O(log n) - Insert</li>
<li>O(log n) - Remove Min</li>
<li>O(log n) - Remove Max</li>
</ul>
