func insert()

in tree/tree.go [28:38]

• 11 lines of code
• 3 McCabe index (conditional complexity)

func insert(t *Tree, v int) *Tree {
	if t == nil {
		return &Tree{nil, v, nil}
	}
	if v < t.Value {
		t.Left = insert(t.Left, v)
	} else {
		t.Right = insert(t.Right, v)
	}
	return t
}