Question:

PREVIOUS EXERCISE:

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. C-3.3 Describe how to perform the operation findAllElements(k), which returns every element with a key equal to k (allowing for duplicates) in an ordered set of n key value pairs stored in an ordered array, and show that it runs in time O(log n+ s), where s is the number of elements returned