import { N, B, F } from './baseType';
interface BinaryTreeNode<T> {
    value: T;
    left: BinaryTreeNodeOrNull<T>;
    right: BinaryTreeNodeOrNull<T>;
    parent: BinaryTreeNodeOrNull<T>;
    isRoot: () => B;
    hasParent: () => B;
    hasLeft: () => B;
    hasRight: () => B;
    hasChild: () => B;
    hasBothChild: () => B;
    isLeaf: () => B;
}
declare type BinaryTreeNodeOrNull<T> = (BinaryTreeNode<T> | null);
interface BinaryTree<T> {
    root: BinaryTreeNodeOrNull<T>;
    createBTNode: (v: T) => BinaryTreeNode<T>;
    insertAsLeft: (parent: BinaryTreeNode<T>, current: T) => void;
    insertAsRight: (parent: BinaryTreeNode<T>, current: T) => void;
    _preOrderTraverse: (cb: F, node: BinaryTreeNodeOrNull<T>) => void;
    _inOrderTraverse: (cb: F, node: BinaryTreeNodeOrNull<T>) => void;
    _postOrderTraverse: (cb: F, node: BinaryTreeNodeOrNull<T>) => void;
    _levelTraverse: (cb: F, node: BinaryTreeNodeOrNull<T>) => void;
    isEmpty: () => B;
    _height: (node: BinaryTreeNodeOrNull<T>, h: N) => N;
    height: (node: BinaryTreeNodeOrNull<T>) => N;
    deep: (node: BinaryTreeNodeOrNull<T>) => N;
    minDeep: () => N;
    getLevelNode: (p: N) => BinaryTreeNode<T>[];
    isProper: () => B;
    vertexCount: () => N;
    isFull: () => B;
    isComplete: () => B;
}
declare type BinarySearchTreeOrder = 'preOrder' | 'inOrder' | 'postOrder' | 'level';
interface BinarySearchTreeNode<T> extends BinaryTreeNode<T> {
    key: N;
    value: T | null;
    left: BinarySearchTreeNodeOrNull<T>;
    right: BinarySearchTreeNodeOrNull<T>;
    parent: BinarySearchTreeNode<T>;
    clone: () => BinarySearchTreeNode<T>;
    'operator<': (otherNode: BinarySearchTreeNode<T>) => B;
    'operator>': (otherNode: BinarySearchTreeNode<T>) => B;
    'operator===': (otherNode: BinarySearchTreeNode<T>) => B;
    'operator!==': (otherNode: BinarySearchTreeNode<T>) => B;
    isLeft: () => B;
    isRight: () => B;
    sibling: () => BinarySearchTreeNodeOrNull<T>;
    uncle: () => BinarySearchTreeNodeOrNull<T>;
}
declare type BinarySearchTreeNodeOrNull<T> = BinarySearchTreeNode<T> | null;
interface BinarySearchTree<T> extends Pick<BinaryTree<T>, '_preOrderTraverse' | '_inOrderTraverse' | '_postOrderTraverse'> {
    root: BinarySearchTreeNodeOrNull<T>;
    createBSTNode: (k: N, v: T) => BinarySearchTreeNode<T>;
    insertAsLeft: () => Error;
    insertAsRight: () => Error;
    insert: (k: N, v: T) => Error | BinarySearchTreeNode<T>;
    _insertNode: (n0: BinarySearchTreeNode<T>, n1: BinarySearchTreeNode<T>) => void;
    search: (k: N) => BinarySearchTreeNodeOrNull<T>;
    traverse: (fn: F, order: BinarySearchTreeOrder) => void;
    min: () => T | undefined;
    max: () => T | undefined;
    findMinNode: (node: BinarySearchTreeNodeOrNull<T>) => BinarySearchTreeNodeOrNull<T>;
    findMaxNode: (node: BinarySearchTreeNodeOrNull<T>) => BinarySearchTreeNodeOrNull<T>;
    _remove: (node: BinarySearchTreeNodeOrNull<T>, k: N) => BinarySearchTreeNodeOrNull<T>;
    remove: (k: N) => void;
}
interface AVLTree<T> extends BinarySearchTree<T> {
    insert: (k: N, v: T) => Error | BinarySearchTreeNode<T>;
    _insertNode: (n0: BinarySearchTreeNode<T>, n1: BinarySearchTreeNode<T>) => void;
    _rotationRR: (node: BinarySearchTreeNode<T>) => BinarySearchTreeNode<T>;
    _rotationLL: (node: BinarySearchTreeNode<T>) => BinarySearchTreeNode<T>;
    _rotationLR: (node: BinarySearchTreeNode<T>) => BinarySearchTreeNode<T>;
    _rotationRL: (node: BinarySearchTreeNode<T>) => BinarySearchTreeNode<T>;
    _connect34: (a: BinarySearchTreeNode<T>, b: BinarySearchTreeNode<T>, c: BinarySearchTreeNode<T>, t0: BinarySearchTreeNodeOrNull<T>, t1: BinarySearchTreeNodeOrNull<T>, t2: BinarySearchTreeNodeOrNull<T>, t3: BinarySearchTreeNodeOrNull<T>) => BinarySearchTreeNode<T>;
    rotateAt: (v: BinarySearchTreeNode<T>) => BinarySearchTreeNode<T>;
    remove: (k: N) => B;
}
interface RedBackTree<T> extends BinarySearchTree<T> {
}
interface SplayTree<T> extends BinarySearchTree<T> {
    splay: (v: BinarySearchTreeNodeOrNull<T>) => BinarySearchTreeNodeOrNull<T>;
    searchSplayTreeNode: (k: N) => BinarySearchTreeNodeOrNull<T>;
    insertSplayTreeNode: (k: N, v: T) => Error | BinarySearchTreeNode<T>;
}
interface BTreeNode<T> {
    nodeList: [];
    childList: [];
}
declare type BTreeNodeOrNull<T> = (BTreeNode<T> | null);
interface BTree<T> {
    order: N;
    searchBTreeNode: (k: N) => BTreeNodeOrNull<T>;
    insertBTreeNode: (k: N, v: T) => BTreeNode<T>;
    remove: (k: N) => BTreeNode<T>;
    resolveOverflow: (n: BTreeNode<T>) => void;
    resolveUnderflow: (n: BTreeNode<T>) => void;
}
export { BinaryTreeNode, BinaryTreeNodeOrNull, BinaryTree, BinarySearchTreeNode, BinarySearchTreeNodeOrNull, BinarySearchTree, AVLTree, SplayTree, RedBackTree, BTreeNode, BTree, };