What is the worst-case running time of unions done by size and path compression?
(c) O(N logN)
(d) O(M logN)
My question is based upon Trees topic in section Trees of Data Structures & Algorithms I
The question was asked by my school teacher while I was bunking the class.