This class supports insertion and deletion of elements in a simple
binary tree (e.g., the tree is not a balanced tree like an AVL tree
or a red-black tree).
The constructor is initialized with an instance of the Comparator
interface, which supports the compare() method which is used to
compare objects in the tree with a search key.
Return an ordered array of tree objects, where Object values
(as determined by the Comparator object used to initialize the BinaryTree
constructor) increase with the array indices (e.g., the smallest value
is at index 0, the largest value is at index n.
When a value is removed from an ordered binary tree and the value
has two children, it will be replaced by the next value in the right
sub-branch which is greater.