+1 vote
in Data Structures & Algorithms I by (88.2k points)
How many prime concepts are available in nearest neighbour search in a kd tree?

(a) 1

(b) 2

(c) 3

(d) 4

The above asked question is from Trees in division Trees of Data Structures & Algorithms I

The question was asked by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (c) 3

Easiest explanation - Three important concepts are available in finding the nearest neighbour. They are partial results, pruning, traversal order.

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.