What is the worst-case running time of unions done by size and path compression?
A. O(N)
B. O(logN)
C. O(N logN)
D. O(M logN)
Answer: Option D
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion