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

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

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.remove

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

remove(value: Partial<T>): boolean

Removes node value from the binary search tree if found. Returns true if found and removed.

Parameters

value: Partial<T>

Returns

boolean