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

› Category: Questions › Which of the following is the simplest data structure that supports range searching?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months 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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months 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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts