class BinarySearchTreeRe-exportimport { BinarySearchTree } from "https://deno.land/x/masx200_leetcode_test@8.1.5/deps.ts"; ConstructorsnewBinarySearchTree(compare?: (a: T, b: T) => number)Type ParametersTMethodsceil(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | nullclear(): voidcount(): numberfind(value: T): BinarySearchTreeNode<T> | nullfloor(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | nullhas(value: T): booleaninsert(value: T): BinarySearchTree<T>lowerBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | nullmax(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | nullmin(node?: BinarySearchTreeNode<T>): BinarySearchTreeNode<T> | nullremove(value: T): booleanroot(): BinarySearchTreeNode<T> | nulltraverseInOrder(cb: (node: BinarySearchTreeNode<T>) => void): voidtraversePostOrder(cb: (node: BinarySearchTreeNode<T>) => void): voidtraversePreOrder(cb: (node: BinarySearchTreeNode<T>) => void): voidupperBound(value: T, includeEqual?: boolean): BinarySearchTreeNode<T> | null