Write a function that takes in a binary search tree of height H
and an element, then removes the element from the binary search
tree.  This function should run in time O(H).