Data structures and algorithms
With both union by rank and path compression, what is the amortised cost of a…
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.
Report an issue with this question
Learn the method
Of the kind reported at
More data structures and algorithms questions
- Converting between currencies, part 2 of 3Applied · Premium
- Converting between currencies, part 3 of 3Expert · Premium
- What is the maximum number of edges in a directed acyclic graph on ten vertices?Foundation · Premium
- A dependency graph has edges a → b, a → c, b → d, c → d.Foundation · Premium
- Converting between currencies, part 1 of 3Foundation · Premium
- Your shortest-path graph has some negative edge weights but no negative cycles.Applied · Premium