Question :
Suppose we have two binary search trees B1 and B2 Give an algorithm to merge B1 and B2 into a single binary search tree, and runs in time linear in the sum of the sizes of the two trees.
Give good justification (not a proof) that it is correct and that it runs in the prescribed time bounds.