Ask your own question, for FREE!
Computer Science 12 Online
OpenStudy (anonymous):

Suppose that you are using the weighted quick-union data structure (without path compression) on a set of N elements. What is the maximum depth of a node? Choose one. 1 log∗⁡N lg⁡N N

OpenStudy (anonymous):

It's LgN, and Lg = base-2 logarithm

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!