What is the worst case efficiency for a path compression algorithm?
PYQ Accenture 2024
What is the worst case efficiency for a path compression algorithm?
- A.
O(M log N)
- B.
O(N log N)
- C.
O(log N)
- D.
O(N)
Attempted by 130 students.
Sign up free to check your answer
Sign up freeLoading lesson…