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.