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