Vidyalelo
Data Structure · Q133

Trees in Data Structures

Programming · Data Structure · question 133

Q133

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)
Answer
D.
O(M log N)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board