BSTree | /trees/bs_tree.ts | collections@0.12.1

x/collections/trees/bs_tree.ts>BSTree#find

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.

udibo/collections

Very Popular

Latest

method BSTree.prototype.find

import { BSTree } from "https://deno.land/x/collections@0.12.1/trees/bs_tree.ts";

find(value: T): T | null

Returns node value if found in the binary search tree.

Parameters

value: T

Returns

T | null