Advanced
Data Structures & Algorithms
Q91 / 100
What is the link-cut tree and what problems does it solve?
Correct! Well done.
Incorrect.
The correct answer is B) A data structure supporting dynamic tree operations (link, cut, path queries) in O(log n) amortized, enabling dynamic graph algorithms
B
Correct Answer
A data structure supporting dynamic tree operations (link, cut, path queries) in O(log n) amortized, enabling dynamic graph algorithms
Explanation
Link-cut trees (Sleator-Tarjan) use auxiliary splay trees to represent paths. They support link, cut, find-root, and path-aggregate operations in O(log n) amortized.
Progress
91/100