1.

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 in such numbers in T.If the tightest upper bound on the time to compute the sum is O(na logbn + mc logdn), the value of a + 10b + 100c + 1000d is ___110

Answer» 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 in such numbers in T.

If the tightest upper bound on the time to compute the sum is O(na logbn + mc logdn), the value of a + 10b + 100c + 1000d is ___
  1. 110


Discussion

No Comment Found