Consider two binary search trees T1 and T2, each with height h, with all values in T1 less than all values in T2. I want to merge these both trees to get a new binary search tree of height at most h+1
My Thoughts:
The first thought was to put T1 as the left child of the leftmost node in T2. But the resulting bst will have height > h+1 I am not sure if there is a clever way to achieve this