diff --git a/algorithms/CPlusPlus/DisjointSetUnion/disjoint_set_union.cpp b/algorithms/CPlusPlus/DisjointSetUnion/disjoint_set_union.cpp
new file mode 100644
index 00000000..70bae031
--- /dev/null
+++ b/algorithms/CPlusPlus/DisjointSetUnion/disjoint_set_union.cpp
@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+/*
+Disjoint set union data structure supporting find and union operations.
+Time Complexity: O(a(N)) where a(N) is the Inverse Ackerman function.
+*/
+const int N=1e3;
+vector<int>P(N),S(N);
+
+// create new node
+void create(int u){
+    P[u]=u;S[u]=1;
+}
+// find parent of node
+int find(int u){
+    if(u==P[u])return u;
+    return P[u]=find(P[u]);
+}
+// merge 2 nodes
+void merge(int u,int v){
+    u=find(u);
+    v=find(v);
+    if(u!=v){
+        if(S[u]<S[v]){
+            P[u]=v;
+            S[v]+=S[u];
+        }else{
+            P[v]=u;
+            S[u]+=S[v];
+        }
+    }
+}