1.

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)
Answer» E.


Discussion

No Comment Found