GATE Computer Science (CS) 2020 Solved Papers

Question : 45 of 65

Marks: +1, -0

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.