Show that this binary search tree algorithm is O(h + s) where h is the height of T and s is the number of items returned.

Here is the algorithm itself, I just need the proof for it's time complexity.

C-3.4 Describe how to perform the operation findAllElements(k), as defined in the previous exercise, in an ordered set of key-value pairs implemented with a binary search tree T, and show that it runs in time O(h + s), where h is the height of T and s is the number of items returned