MediumRememberDSA Coding PatternsMultiple Choice

What is the time complexity of Union-Find with path compression and union by rank?

Remember Tests recall of fundamental facts and definitions.

Answer Options

AO(n)
BO(log n)
CO(α(n)) ≈ O(1)
DO(n log n)

Want to see the correct answer?

Get the answer with a detailed explanation, plus practice 13+ more DSA Coding Patterns questions with adaptive quizzes and timed interviews.

See the Answer on Guru Sishya →

This question is from the DSA Coding Patterns topic (Algorithms).

More DSA Coding Patterns Questions