Q. 49 Suppose we have a balanced binary search tree T holding n numbers. We are
given two numbers L and H and wish to sum up all the numbers in T that lie
between L and H . Suppose there are m such numbers in T . If the tightest upper
bound on the time to compute the sum is O^na logbn + mc logdnh, the value of
a + 10b + 100c + 1000d is ________.
(A) 60
(B) 110
(C) 210
(D) 50
Answer: (B)
Explanation:
