MCPcopy Index your code
hub / github.com/0xAX/go-algorithms / Min

Method Min

binaryTree/binaryTree.go:55–60  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

53}
54
55func (tree *BinaryTree) Min() interface{} {
56 if tree.node == nil || tree.left.node == nil {
57 return tree.node
58 }
59 return tree.left.Min()
60}

Callers 2

Test_minmaxFunction · 0.80
jumpSearchFunction · 0.80

Calls

no outgoing calls

Tested by 1

Test_minmaxFunction · 0.64