Method Insert

data-structures/binary-tree/bst.go:38–68

(i int)

}

func (t *Tree) Insert(i int) {
	n := &Node{Value: i}
	if t.Head == nil {
		t.Head = n
		t.Size++
		return
	}

	h := t.Head

	for {
		if n.Compare(h) == -1 {
			if h.Left == nil {
				h.Left = n
				n.Parent = h
				break
			} else {
				h = h.Left
			}
		} else {
			if h.Right == nil {
				h.Right = n
				n.Parent = h
				break
			} else {
				h = h.Right
			}
		}
	}
	t.Size++
}

func (t *Tree) Search(i int) *Node {
	h := t.Head