CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
Union-Find (DSU)
Question 1 of 12
8% Complete
Easy
Union-Find achieves near-constant time operations by which optimizations?
A
Path compression and union by rank/size
B
Binary lifting
C
Segment tree with lazy propagation
D
Priority queue