MCPcopy Create free account
hub / github.com/arnauddri/algorithms / NewNode

Function NewNode

data-structures/binary-tree/bst.go:12–14  ·  view source on GitHub ↗
(i int)

Source from the content-addressed store, hash-verified

10}
11
12func NewNode(i int) *Node {
13 return &Node{Value: i}
14}
15
16func (n *Node) Compare(m *Node) int {
17 if n.Value < m.Value {

Callers 1

TestTreeFunction · 0.70

Calls

no outgoing calls

Tested by 1

TestTreeFunction · 0.56