MCPcopy Create free account
hub / github.com/denoland/std / findMinNode

Method findMinNode

data_structures/_binary_search_node.ts:39–43  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

37 }
38
39 findMinNode(): BinarySearchNode<T> {
40 let minNode: BinarySearchNode<T> | null = this.left;
41 while (minNode?.left) minNode = minNode.left;
42 return minNode ?? this;
43 }
44
45 findMaxNode(): BinarySearchNode<T> {
46 let maxNode: BinarySearchNode<T> | null = this.right;

Callers 3

minMethod · 0.80
findSuccessorNodeMethod · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected