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)
• D. O( N log N)