Draw the tree corresponding to the id[] array depicted at right. Can this be the result of running weighted quick-union?
Explain why this is impossible or give a sequence of operations that results in this array.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.