Let T be a binary search tree, and let z be a key. Give an efficient algorithm for finding the smallest key y in T such that y > r. Note that r may or may not be in T. Explain why your algorithm has...

Extracted text: Let T be a binary search tree, and let z be a key. Give an efficient algorithm for finding the smallest key y in T such that y > r. Note that r may or may not be in T. Explain why your algorithm has the running time it does.