Go to Latest
method BinarySearchTree.from
import { BinarySearchTree } from "https://dotland.deno.dev/std@0.223.0/data_structures/binary_search_tree.ts";

Creates a new binary search tree from an array like or iterable object.

Parameters

collection: ArrayLike<T> | Iterable<T> | BinarySearchTree<T>

Parameters

collection: ArrayLike<T> | Iterable<T> | BinarySearchTree<T>
options: { compare?: (a: T, b: T) => number; }

Parameters

collection: ArrayLike<T> | Iterable<T> | BinarySearchTree<T>
options: { compare?: (a: U, b: U) => number; map: (value: T, index: number) => U; thisArg?: V; }