What will be the time complexity of delete operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)
(d) O(log m)
This interesting question is from Trees topic in chapter Trees of Data Structures & Algorithms I
I had been asked this question in my homework.