There are lots of sources about amortized complexity or union-find, quick-find operations but I couldn't find anything about the proof of single union operation complexity.
So, how can I prove that the amortized complexity of the union operation is O(log n).
Thanks.