Question: Let T and U be (2,4) trees storing n and m entries, respectively, such that all the entries in T have keys less than the
Let T and U be (2,4) trees storing n and m entries, respectively, such that all the entries in T have keys less than the keys of all the entries in U. Describe an O(logn+logm)-time method for joining T and U into a single tree that stores all the entries in T and U.
Step by Step Solution
3.52 Rating (176 Votes )
There are 3 Steps involved in it
Assume that T and U have heights h t and h u and h t h u R... View full answer
Get step-by-step solutions from verified subject matter experts
