Give the state of the disjoint-sets data structure after the following sequence of operations, starting from singleton sets {1},..., {8}. Use path compression. In case of ties, always make the lower numbered root point to the higher numbered one.
union(1, 2), union(3, 4), union(5, 6), union(7, 8), union(1, 4),
union(6, 7), union(4, 5), find(1)
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.