Max Heap implementation, lowest value in heap is always at the root.


Performance

BestWorst
InsertO(log n)O(log n)
RemoveO(log n)O(log n)
PeekO(1)O(1)
ContainsO(n)O(n)

Extends

Constructor

Defined collections/MaxHeap.js

License

MIT https://github.com/C2FO/comb/raw/master/LICENSE

Meta