Suppose we have a balanced binary search tree \(T\) holding \(n\) numbers. We…
PYQ GATE 2014
Suppose we have a balanced binary search tree holding numbers. We are given two numbers and and wish to sum up all the numbers in that lie between and . Suppose there are such numbers in . If the tightest upper bound on the time to compute the sum is , the value of is ______.
Attempted by 177 students.
Sign up free to check your answer
Sign up freeLoading lesson…

