Function NewTree

data-structures/binary-tree/bst.go:31–36

(n *Node)

}

func NewTree(n *Node) *Tree {
	if n == nil {
		return &Tree{}
	}
	return &Tree{Head: n, Size: 1}
}

func (t *Tree) Insert(i int) {
	n := &Node{Value: i}