In what time can a leftist heap be built?

(a) O(N)

(b) O(N log N)

(c) O(log N)

(d) O(M log N)

The query is from Heap topic in portion Heap of Data Structures & Algorithms I

The question was asked in a job interview.

In what time can a leftist heap be built?

(a) O(N)

(b) O(N log N)

(c) O(log N)

(d) O(M log N)

The query is from Heap topic in portion Heap of Data Structures & Algorithms I

The question was asked in a job interview.