带路径压缩的加权快速联合。 深度如何达到4？

Question

I am trying to achieve a depth of 4 applying Weighted Quick-Union with Path Compression. Can you please help how to simulate it. I meant to ask sequence of union operations that that may result in depth of 4.

Answer 1

As a hint, start with 32 elements. What happens if you pairwise link the elements, then pairwise link the roots of those new trees, then pairwise link the roots of those trees, etc.? I'll leave the rest of the details as an exercise, since this looks like a homework question.

Hope this helps!