Q246
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.
A.
O(m+n)
AnswerB.
O(mn)
C.
O(m)
D.
O(mlog n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board