/**
 * 1. 堆满足：总是一个完全二叉树
 * 2. 堆的性质：任何子树的父节点总是比它的子节点大
 */
declare class BigHeap<T> {
    data: T[];
    constructor(data?: T[]);
    private initData;
    peek(): T | boolean;
    poll(): T | boolean;
    private downBubble;
    private swap;
    private upBubble;
    offer(value: T): boolean;
    isEmpty(): boolean;
    size: () => number;
}
export { BigHeap };