+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the run time of finding the nearest neighbour in a k-d tree?

(a) O(2+ log N)

(b) O( log N)

(c) O(2^d log N)

(d) O( N log N)

My query is from Trees topic in chapter Trees of Data Structures & Algorithms I

The question was asked in homework.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right answer is (c) O(2^d log N)

To explain: The run time of finding the nearest neighbour in a kd tree is given as O(2^d log N) where 2^d is the time taken to search the neighbourhood.

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.

Categories

...