Do exercise 1, but use quick-union. In addition, draw the forest of trees represented by the id[] array after each input pair is processed.
Exercise 1
Show the contents of the id[] array and the number of times the array is accessed for each input pair when you use quick-find for the sequence 9-0 3-4 5-8 7-2 2-1 5-7 0-3 4-2.
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.