Explain how to implement a union-find (disjoint-set) data structure in [LANGUAGE], optimized for [USE_CASE]. Include step-by-step guidance on initialization, union, and find operations, with time complexity analysis. Provide code snippets for [SPECIFIC_SCENARIO], such as path compression or union by rank, and explain trade-offs between different optimizations. Ensure clarity for intermediate-level programmers.