import { CompareFn } from "./Util";
declare class BinarySearchTree<T> {
    private _root;
    private readonly _compareFn;
    private _length;
    /**
     *
     * @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>);
    inOrderTraversal(fromNode?: BinarySearchTreeNode<T>): Generator<T, void, void>;
    preOrderTraversal(fromNode?: BinarySearchTreeNode<T>): Generator<T, void, void>;
    postOrderTraversal(fromNode?: BinarySearchTreeNode<T>): Generator<T, void, void>;
    levelTraversal(fromNode?: BinarySearchTreeNode<T>): Generator<T, void, void>;
    contains(value: T): BinarySearchTreeNode<T> | undefined;
    min(fromNode?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | undefined;
    max(fromNode?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | undefined;
    successor(ofNode: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | undefined;
    predecessor(ofNode: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | undefined;
    add(value: T): number;
    remove(value: T): T | undefined;
    get length(): number;
}
declare class BinarySearchTreeNode<T> {
    value: T;
    left: BinarySearchTreeNode<T> | undefined;
    right: BinarySearchTreeNode<T> | undefined;
    parent: BinarySearchTreeNode<T> | undefined;
    constructor(value: T, left?: BinarySearchTreeNode<T>, right?: BinarySearchTreeNode<T>, parent?: BinarySearchTreeNode<T>);
    inOrderTraversal(): Generator<T, void, void>;
    preOrderTraversal(): Generator<T, void, void>;
    postOrderTraversal(): Generator<T, void, void>;
    levelTraversal(): Generator<T, void, void>;
}
export default BinarySearchTree;