+1 vote
in Data Structures & Algorithms I by (110k points)
What is the total time spent for N-1 merges in a dynamic equivalence problem?

(a) O(N)

(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.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (c) O(N log N)

Easy explanation - The total time spent for N-1 merges in a dynamic equivalence problem is mathematically found to be O(N log N).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...