Min Heap implementation, lowest value in heap is always at the root.
| Best | Worst | |
| Insert | O(log n) | O(log n) |
| Remove | O(log n) | O(log n) |
| Peek | O(1) | O(1) |
| Contains | O(n) | O(n) |
MIT https://github.com/C2FO/comb/raw/master/LICENSE
git clone git://github.com/C2FO/comb.git