Q71
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(2d log N)
AnswerD.
O( N log N)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board