Vidyalelo
Data Structure · Q151

Trees in Data Structures

Programming · Data Structure · question 151

Q151

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

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board