What will be the time complexity of insertion 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)
The query is from Trees in section Trees of Data Structures & Algorithms I
The question was asked in homework.