Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 362
A disjoint-set forest without union by rank or path compression can degrade to what height?
A
O(n), forming a chain
B
O(1)
C
O(log n)
D
O(√n)