import { BinarySearchTree } from "https://deno.land/x/masx200_leetcode_test@9.1.2/deps.ts";
Methods
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
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
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