In what time can a 2-d tree be constructed?

(a) O(N)

(b) O(N log N)

(c) O(N^2)

(d) O(M log N)

My enquiry is from Trees topic in portion Trees of Data Structures & Algorithms I

This question was posed to me during a job interview.