Question

Union-Find with Path Compression achieves nearly:

A O(1) per operation
B O(log n)
C O(n)
D O(√n)
E O(log log n)
Practice Next

Hey! Ask a query