What will be the time complexity of query operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (k = number of bins query rectangle intersects)
(d) O(log k)
Query is from Trees topic in section Trees of Data Structures & Algorithms I
This question was posed to me in examination.