AdvancedMultiple choice
With both union by rank and path compression, what is the amortised cost of a union–find operation?
- A, the height of a balanced tree
- B, the inverse Ackermann function
- C in the worst case for every single operation
- D, because finds may walk long chains
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
Reported in interviews at
More data structures and algorithms questions
- What is the maximum number of edges in a directed acyclic graph on ten vertices?Foundation
- A dependency graph has edges a → b, a → c, b → d, c → d.Foundation
- Converting between currencies, part 1 of 3Foundation
- Your shortest-path graph has some negative edge weights but no negative cycles.Applied
- What is the running time of Dijkstra’s algorithm with a binary heap, on a graph…Applied
- A graph has edges A–B (weight 1), B–C (2), A–C (3), C–D (4) and B–D (5).Applied