Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Two balanced binary trees are given with m and n elements, respectively. They can be merged into a balanced binary search tree in ______ time.
1
O(m*n)
2
O(m + n)
3
O(m*log n)
4
O(m*log(m + n))