A data-structure class to represent a binary heap.
https://en.wikipedia.org/wiki/Binary_heap
The heap's nodes type.
Construct a binary heap object.
The function used to make heap's nodes comparisons.
Decrease the value of a node in the heap and sort the tree accordingly.
The data of the element to update.
Delete a node from the heap and sort the tree accordingly.
The id of the element to delete.
Pop the first node from the heap and sort the tree accordingly.
A node or undefined if the heap is empty.
Increase the value of a node in the heap and sort the tree accordingly.
Insert a node to the heap.
The node to insert in the heap.
Search a node from the heap.
The id of the searched element.
The searched node or undefined if nothing match findPredicate.
A data-structure class to represent a binary heap.
Link
https://en.wikipedia.org/wiki/Binary_heap