Heap constructor
Number elemnets in heap
Heap iterator for iteration across all key-value tuples
Complexity: O(n)
Clear all values
Complexity: O(1)
Tale top element from heap
Complexity: O(log n)
Find el index by value
Complexity: O(n)
Insert new value in heap
Complexity: O(n)
Max heap order
is empty check
Complexity: O(1)
Read top element
Complexity: O(1)
Remove element by value
Complexity: O(n) + O(log n)
Replace value and re-balance heap
Complexity: O(n) + O(log n)
Max heap Root element has largest value