Askmeabout

Lets share our knowledge

Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.

Q & A › Category: Data Structure › Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.
0 Vote Up Vote Down
Admin Staff asked 4 years ago

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)
b) O(mn)
c) O(m)
d) O(mlog n)

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

a) O(m+n)