Union/find algorithm without union by rank for disjoint-set forests data structure

Question

Here\'s a breakdown on the union/find algorithm for disjoint set forests on wikipedia:

• Barebone disjoint-set forests... (O(n))
  • ... with unio

Answer 1

I googled for "without union by rank" and the second link that came up was this one:

...We close this section with an analysis of union–find with path compression but without union by rank...

The union-find datastructure with path compression but without union by rank processes m find and n-1 link operations in time O((m+n) log n)