Binary a binary search tree consists of a branch structure, where each branch has a value, and 2 branch options.

The insert function, insterts on the left side smaller & equal values to the value of the branch

insert (Tree, number)-> Number= value to insert in the tree Tree= The tree the value is going to be inserted in