Suppose we are given two sorted search tables S and T, each with n entries (with and T being implemented with arrays). Describe an O(log2 n)-time algorithm for finding the k th smallest key in the union of the keys from S and T (assuming no duplicates)
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.