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)
A. O(1)
B. O(m)
C. O(m2)
D. O(log m)
Answer: Option B
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion