Create a binary tree from an array of ints such that a left child has value less than its roots value, and a right child has a value greater than or equal to the value of its root.

Insert a new element by comparing its value to the root and recurring down the proper subtree until NULL is reached.