Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.
(d) O(mlog n)
My question is taken from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I
The question was posed to me in a job interview.