Class comb.collections.MinHeap
Extends
comb.collections.Heap.
Min Heap implementation, lowest value in heap is always at the root.
PerformanceBest | 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) |
Constructor Attributes | Constructor Name and Description |
---|---|
- Fields borrowed from class comb.collections.Heap:
- count, isEmpty, keys, values
- Methods borrowed from class comb.collections.Heap:
- clear, containsKey, containsValue, insert, peek, peekKey, print, remove
- Methods borrowed from class comb.collections.Collection:
- concat, indexOf, join, lastIndexOf, slice, toString
Documentation generated by JsDoc Toolkit 2.4.0 on Fri Nov 18 2011 01:10:52 GMT-0600 (CST)