Several kinds of queries are possible on a k-d called as?

Category: QuestionsSeveral kinds of queries are possible on a k-d called as?
Editor">Editor Staff asked 1 month ago

Several kinds of queries are possible on a k-d called as?
 
(a) partial queries
 
(b) range queries
 
(c) neighbour queries
 
(d) search queries
 
This interesting question is from Trees topic in chapter Trees of Data Structures & Algorithms I
 
I had been asked this question in homework.

1 Answers
Editor">Editor Staff answered 1 month ago

Right answer is (b) range queries
 
The explanation is: Several range queries are possible on a k-d tree. One of the range queries is known as a partial match query.