comb

comb

github

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

Performance

	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)

Extends

comb.collections.Heap

Constructor

Defined collections/MinHeap.js

License

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

Meta

Code: git clone git://github.com/C2FO/comb.git
Website: http://c2fo.com
Twitter: http://twitter.com/c2fo - 877.465.4045