Gets the current number of elements in the min-heap.
The number of elements in the heap.
Makes the MinHeap iterable.
Note: The traversal follows the order of the underlying array, not the priority order.
Optionalreversed: boolean = falseIf true, the iterator will traverse the heap in reverse order.
An iterator yielding heap elements in the specified order.
Adds a new element to the heap while maintaining the min-heap property.
The element to add to the heap.
Clears the heap by removing all elements.
Decreases the key value of a heap element by a specified amount.
The element to modify.
Amount to decrease the key by.
true if element was found and modified, false otherwise.
Returns an iterator for traversing all elements in the min-heap.
Note: The traversal follows the order of the underlying array, not the priority order.
Optionalreversed: boolean = falseIf true, the iterator will traverse the heap in reverse order.
An iterator yielding heap elements in the specified order.
Increases the key value of a heap element by a specified amount.
The element to modify.
Amount to increase the key by.
true if element was found and modified, false otherwise.
Returns an iterator for traversing just the key values in the min-heap.
Note: The traversal follows the order of the underlying array, not the priority order.
Optionalreversed: boolean = falseIf true, the iterator will traverse the heap in reverse order.
An iterator yielding heap element keys in the specified order.
Returns the minimum element (root) of the min-heap without removing it.
The minimum element or undefined if the heap is empty.
Removes and returns the minimum element (root) from the min-heap.
The minimum element or undefined if the heap is empty.
Removes a specific element from anywhere in the min-heap.
The element to remove.
true if element was found and removed, false otherwise.
A concrete implementation of a min-heap data structure.
In a min-heap, for any given node, the node's key value is less than or equal to the key values of its children.