Addressable Binary Heaps - v1.0.1
    Preparing search index...

    Function keys

    • 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.

      Type Parameters

      Parameters

      • instance: H

        The min-heap instance.

      • Optionalreversed: boolean = false

        If true, the iterator will traverse the heap in reverse order.

      Returns Generator<number, void, unknown>

      An iterator yielding heap elements in the specified order.