import { CompareFn } from "./Util";
declare class Heap<T> {
    private readonly _data;
    private readonly _compareFn;
    /**
     *
     * @param compareFn Function used to determine the order of the elements.
     *  It is expected to return a negative value if first argument is less than
     *  second argument, zero if they're equal and a positive value otherwise.
     *  If omitted, the elements are sorted in ascending order using < and >
     *  operators.
     */
    constructor(compareFn?: CompareFn<T>);
    peek(): T | undefined;
    removeRoot(): T | undefined;
    add(value: T): number;
    get length(): number;
    empty(): boolean;
    private static heapify;
    private static parent;
    private static left;
    private static right;
}
export default Heap;