+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Suppose we are given two sorted search tables S and T, each with n entries (with S and T being…

Suppose we are given two sorted search tables S and T, each with n entries (with S and T being…

Suppose we are given two sorted search tables S and T, each with n entries (with S and T being implemented with arrays). Describe an O(log2 n)-time algorithm for finding the kth smallest key in the union of the keys from S and T (assuming no duplicates).