+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.