1.

Given two Balanced binary search trees, B1 having n elements and B2 having m elements, what is the time complexity of the best known algorithm to merge these trees to form another balanced binary tree containing m+n elements ?(A) O(m+n)(B) O(mlogn)(C) O(nlogm)(D) O(m2 + n2)

Answer»


Discussion

No Comment Found

Related InterviewSolutions