What is the total time spent for N-1 merges in a dynamic equivalence problem?
(b) O(log N)
(c) O(N log N)
(d) O(M log N)
The above asked question is from Trees in section Trees of Data Structures & Algorithms I
The question was asked in unit test.