What is the worst case efficiency for a path compression algorithm?
A. O(N)
B. O(log N)
C. O(N log N)
D. O(M log N)
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