Question

Assume that the disjoint sets data structure is implemented as disjoint trees with union by rank heuristic and with path compression heuristic.
Compute the maximum height of a tree in the resulting forest. (Recall that the height of a tree is the number of edges on a longest path from the root to a leaf. In particular, the height of a tree consisting of just one node is equal to 0.)

Answer 1

• formula in cell A5=(A1+A2+A3+A4)/4. Create a similar formula in cell A6 and A7 using two different functions so that the output in A5, A6, A7 is same