Which of the following is the simplest data structure that supports range searching?

Category: QuestionsWhich of the following is the simplest data structure that supports range searching?
Editor">Editor Staff asked 1 month ago

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.

1 Answers
Editor">Editor Staff answered 1 month ago

The correct answer is (d) K-d trees
 
Explanation: K-d trees are the simplest data structure that supports range searching and also it achieves the respectable running time.