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

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

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.