BinarySearchTree | /collections/binary_search_tree.ts | std@0.162.0 | Deno

Skip to main content

std/collections/binary_search_tree.ts>BinarySearchTree#min

Deno standard library

denoland/deno_std

Menu

mod.ts (default module)

DeepMergeOptions

JoinToStringOptions

MergingStrategy

aggregateGroups

firstNotNullishOf

aggregate_groups.ts

aggregateGroups

associate_by.ts

associate_with.ts

binary_search_node.ts

BinarySearchNode

binary_search_tree.ts

BinarySearchTree

DeepMergeOptions

MergingStrategy

drop_last_while.ts

filter_entries.ts

filter_values.ts

first_not_nullish_of.ts

firstNotNullishOf

includes_value.ts

join_to_string.ts

JoinToStringOptions

map_not_nullish.ts

permutations.ts

red_black_node.ts

red_black_tree.ts

reduce_groups.ts

running_reduce.ts

sliding_windows.ts

take_last_while.ts

method BinarySearchTree.prototype.min

import { BinarySearchTree } from "https://deno.land/std@0.162.0/collections/binary_search_tree.ts";

min(): T | null

Returns the minimum value in the binary search tree or null if empty.

Returns

T | null