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

    Interface IHeapNode

    An interface representing a node in the binary heap data structure. Each node must have a numeric key that determines its position in the heap.

    interface IHeapNode {
        key: number;
    }
    Index

    Properties

    Properties

    key: number

    The numeric key value used for heap ordering.

    • Lower values have higher priority in a min-heap,
    • higher values have higher priority in a max-heap.