Write the function min-key. It consumes a non-empty bst and produces the smallest key it contains. Your function must not visit every node in the tree.