Q166
What is the worst case efficiency for a path compression algorithm?
A.
O(N)
B.
O(log N)
C.
O(N log N)
D.
O(M log N)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board