Design a data structure for binary trees, and write the following functions on binary trees in Haskell, Python or java.

min max(tree): This function returns a pair (min, max), where min is the minimum element, and max is the maximum element in tree. Note that the tree may not be a binary search tree.