Q41

MCQ2 marks, −0.67

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

(A)

$\Theta (\log n)$

(B)

$\Theta (\log n +k)$

(C)

$\Theta (k \log n)$

(D)

$\Theta ( n \log k)$

Loading…