Question: Assume a Disjoint Set data structure has initially 20 data 6. (20 points) Disjoint Set Assume a Disjoint Set data structure has initially 20 data

Assume a Disjoint Set data structure has initially 20 data

Assume a Disjoint Set data structure has initially 20 data 6. (20

points) Disjoint Set Assume a Disjoint Set data structure has initially 20

6. (20 points) Disjoint Set Assume a Disjoint Set data structure has initially 20 data items with each in its own disjoint set (one node tree). Show the final result (only show the array P for parts a, b & c below; no need to draw the trees) of the following sequence of unions (the parameters of the unions specified in this question are data elements; so assume that the find operation without path compression is applied to the parameters to determine the sets to be merged): union (16,17), union(18,16), union (19,18), union (20,19), union (3,4), union (3,5), union (3,6), union(3,10), union(3,11), union (3,12), union(3,13), union (14,15), union (14,3), union (1,2), union (1,7), union (8,9), union(1,8), union (1,3), union (1,20) when the unions are: a. Performed arbitrarily. Make the second tree the child of the root of the first tree. 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!