Disjoint-set data structure

A Disjoint-set data structure, also known as a union-find data structure, is a data structure that keeps track of a partition of a set into disjoint (non-overlapping) subsets. It supports two primary operations: 1. **Find**: This operation determines which subset a particular element is in. It can be used to check if two elements are in the same subset. 2. **Union**: This operation merges two subsets into a single subset.