a function that returns an integer for each element inserted i nthe heap this value is used to sort the heap content
the maximum number of elements that can be inserted in this heap
the manifest of T, to create arrays of T's
the manifest of T, to create arrays of T's
the manifest of T, to create arrays of T's
the maximum number of elements that can be inserted in this heap
This is a binary heap that is less efficient than the BinomialHeap. It offers more operations, such as delete and update value. smallest first
the type of elements included in the heap