Which of the following is the simplest data structure that supports range searching?
(a) Heaps
(b) binary search trees
(c) AA-trees
(d) K-d trees
The question is from Trees topic in portion Trees of Data Structures & Algorithms I
This question was posed to me in homework.