// Insert insert a node to targetNode.
Insert insert a node to targetNode.
// Insert insert a node to targetNode .
func (t *Tree) Insert(key int) {
	if t.Root == nil {
		t.Root = &Node{key, nil, nil}
	} else {
		RecursiveInsert(t.Root, &Node{key, nil, nil})
	}
}
func ( t * Tree ) Insert ( key int ) { if t . Root == nil { t . Root = & Node { key , nil , nil } } else { RecursiveInsert ( t . Root , & Node { key , nil , nil } ) } }
Insert insert a node to targetNode.
Insert insert a node to targetNode .
// Create a root node