Method insert

Insert the given value in the tree. The tree is traveled until an empty sub-tree is found: If the value is lesser than the one hold by the current node, try to insert it to the left. If the value is greater or equal than the one hold by the current node, try to insert it to the right. The value is

(value int)