BinarySearchTree

class BinarySearchTree<T> {

constructor(compare?: (a: T, b: T) => number);

ceil(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null;

clear(): void;

count(): number;

find(value: T): BinarySearchTreeNode<T> | null;

floor(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null;

has(value: T): boolean;

insert(value: T): BinarySearchTree<T>;

lowerBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null;

max(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | null;

min(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | null;

remove(value: T): boolean;

root(): BinarySearchTreeNode<T> | null;

traverseInOrder(cb: (node: BinarySearchTreeNode<T>) => void): void;

traversePostOrder(cb: (node: BinarySearchTreeNode<T>) => void): void;

traversePreOrder(cb: (node: BinarySearchTreeNode<T>) => void): void;

upperBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null;

}

§Type Parameters

[src]

§Constructors

new BinarySearchTree(compare?: (a: T, b: T) => number)

[src]

§Methods

ceil(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null

[src]

clear(): void

[src]

count(): number

[src]

find(value: T): BinarySearchTreeNode<T> | null

[src]

floor(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null

[src]

has(value: T): boolean

[src]

insert(value: T): BinarySearchTree<T>

[src]

lowerBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null

[src]

max(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | null

[src]

min(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | null

[src]

remove(value: T): boolean

[src]

root(): BinarySearchTreeNode<T> | null

[src]

traverseInOrder(cb: (node: BinarySearchTreeNode<T>) => void): void

[src]

traversePostOrder(cb: (node: BinarySearchTreeNode<T>) => void): void

[src]

traversePreOrder(cb: (node: BinarySearchTreeNode<T>) => void): void

[src]

upperBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null

[src]