Write a Haskell function called convertBST that takes as input an arbitray tree t and returns a tree t$$

that is formatted as a binary search tree such that t and t$$ are equivalent.