What is the run time of finding the nearest neighbour in a k-d tree?

Category: QuestionsWhat is the run time of finding the nearest neighbour in a k-d tree?
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.