Question 4 Match the description on the left to the algorith

Question 4 Match the description on the left to the algorithm (or neither on the right. Each entry in the array contains a reference Choose to its parent in the tree Each entry in the array contains the root of Choose the tree Each entry in the array contains a number Choose that corresponds to one of the connected components. 1 pts

Solution

1.

Quick Union :

Quick union is the correct choice.

2.

Quick Union :

Each entry in the array contains the root of the tree.

Quick union is the correct choice.

3.

Union-Find :

Union-Find data structure is used in Graphs. Which is helpful to performing various operations like connecting nodes, finding connected components etc.

Union find is the correct choice.