range-query

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]? Assume that the number of reported elements is k...

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...

Consider a relational table r with sufficient number of records, having attributes A 1 , A 2 ,....., A n and let 1 $$ \le $$ p $$ \le $$ n. Two queries Q1 and Q2 are given below. $...