import TreeNode from './tree-node';
import * as utils from '../../utils';
declare class BinarySearchTree<T> {
    root: TreeNode<T> | null;
    private sz;
    private compare;
    constructor(compareFunction?: utils.CompareFunction<T>);
    /*****************************************************************************
                                    INSPECTION
    *****************************************************************************/
    size(): number;
    isEmpty(): boolean;
    height(): number;
    private heightHelper;
    /*****************************************************************************
                                    SEARCHING
    *****************************************************************************/
    find(value: T): TreeNode<T> | null;
    findMin(root?: TreeNode<T> | null): TreeNode<T> | null;
    findMax(root?: TreeNode<T> | null): TreeNode<T> | null;
    findSucessor(root: TreeNode<T>): TreeNode<T> | null;
    findPredecessor(root: TreeNode<T>): TreeNode<T> | null;
    /*****************************************************************************
                                    INSERTION/DELETION
    *****************************************************************************/
    insert(value: T): TreeNode<T>;
    remove(node: TreeNode<T>): void;
    private transplant;
    /*****************************************************************************
                                    READING
    *****************************************************************************/
    inorderTraversal(): {
        [Symbol.iterator](): Iterator<T>;
    };
    preorderTraversal(): {
        [Symbol.iterator](): Iterator<T>;
    };
    postorderTraversal(): {
        [Symbol.iterator](): Iterator<T>;
    };
}
export default BinarySearchTree;
//# sourceMappingURL=index.d.ts.map