MediumUnderstandGraphsMultiple Choice
What does path compression do to the amortized complexity of Union-Find?
Understand — Tests comprehension and ability to explain concepts.
Answer Options
AMakes it O(1) worst case
BMakes it O(log n) amortized
CMakes it O(α(n)) amortized
DMakes it O(log log n) amortized
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 33+ more Graphs questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Graphs topic (Algorithms).
More Graphs Questions
What is the time complexity of BFS on a graph with V vertices and E edges?
EasyWhat is the difference between a directed and undirected graph?
EasyWhat property of a graph must hold for topological sort to be possible?
EasyWhat is the in-degree of a node in a directed graph?
EasyWhat does an empty result from Kahn's topological sort indicate?
Medium-Easy