How to mathematically prove that the height of the Weighted QuickUnion Tree can have a maximum height of $\log_2{N}$ where $N$ is the number of elements in the array?A description of Weighted Quick Union is given here (page 30-37).
Proving that maximum possible height of a Weighted Quick Union tree is of the order $\lg(N)$
algorithms;trees;combinatorics