1. MakeSet operation

2. Find operation

3. Union operation

Sometimes, it is called Union-Find data structure or Merge-Find data structure.

### Applications

**Also Read: C Program for Tower of Hanoi Problem**

**Also Read: C Program for Sorting an Array using Heap Sort**

### MakeSet Operation

Initially, input elements are considered as a collection of n sets, of which each element in each set. Each set has different element, so Si ∩ Sj = Φ. This makes sets disjoints.

The operation MakeSet creates a new set containing a single element for each given element. MakeSet creates a set of singleton elements in which each element represent its own set as shown below.

### Union and Find Operation

**For better understanding watch below video:**

In next tutorial we will be discussing about implementations of disjoint-set data structure.

**Author Bio:**

*Manisha Khandelwal is a computer science engineering student who lives in India. Data Structure is one of her favorite subjects. You can find her on Facebook at http://www.facebook.com/mannkhandelwal or contact her on Gmail at manishakhandelwal2611@gmail.com.*