What is the worst case of finding the nearest neighbour?

(a) O(N)

(b) O(N log N)

(c) O( log N)

(d) O(N^3)

Enquiry is from Trees topic in division Trees of Data Structures & Algorithms I

The question was asked during an interview.