# 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 5 months 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.

Editor">Editor Staff answered 5 months 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.

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702