made changes to satisfy the meets of the PR

changes made to satisfy the needs of the PR
- used base lib instead of <bits/stdc++.h>
- changed all stdin's and included pre-declared test cases

data_structures/DSU_path_compresssion.cpp

@@ -1,9 +1,8 @@
-#include <bits/stdc++.h>
+#include <iostream>
+#include <vector>
 
 using namespace std;
 
-#define vi vector<int>
-
 //Disjoint set union 
 class DSU{
     private:
@@ -12,7 +11,7 @@ class DSU{
         // setSize: size of each chunk(set)
         // maxElement : max of each set, using maxElement[representative]
         // minElement : min of each set, using minElement[representative]
-        vi p,depth,setSize,maxElement,minElement;
+        vector<int> p,depth,setSize,maxElement,minElement;
     public:
         // parameter : int n -> maximum number of items
         DSU(int n){
@@ -83,7 +82,7 @@ class DSU{
         }
         //returns min max size of i's set
         void get(int i){
-            cout << get_min(i) << " " << get_max(i) << " " <<size(i) << endl; 
+            cout << "min:" << get_min(i) << " max:" << get_max(i) << " size of set:" <<size(i) << endl; 
         }
         //number of elements of each set
         int size(int i){
@@ -123,25 +122,27 @@ output case#1:
         4 5 2
         1 5 5
 */
+//T(n) = O(n)
 int main(){
-    std::ios_base::sync_with_stdio(0);std::cin.tie(0);std::cout.tie(0);
-    int n,q;cin>>n;cin>>q;
+    int n,q;
+    n = 10; q = 11;
     //n: number of items
     //q: number of queries to be made
     DSU d(n+1);
+    //set 1
+    cout << "set 1:"<<endl;
+    d.UnionSet(1,2); //performs union operation on 1 and 2
+    d.UnionSet(1,4);
+    cout << "Representative of "<< 4 << " is "<< d.findSet(4) << endl; //find the representative of the set which 4 belongs to.
+    d.get(4); //print min max and size of set.
 
-    while(q--){
-        string op;cin>>op;
-        if(op == "union"){
-            int i,j;
-            cin >> i >> j;
-            d.UnionSet(i,j); //performs union operation on i and j
-        }else{
-            int i;
-            cin >> i;
-            d.get(i); //print min max and size of set.
-        }
-    }
+    //set 2
+    cout << "\nset 2"<<endl;
+    d.UnionSet(3,5);
+    d.UnionSet(5,6);
+    d.UnionSet(5,7);
+    cout << "Representative of " << 7 <<" is " << d.findSet(7) << endl;
+    d.get(3);
     
     
 }

data_structures/DSU_union_rank.cpp

@@ -1,14 +1,15 @@
-#include <bits/stdc++.h>
+#include <iostream>
+#include <vector>
+
 
 using namespace std;
 
-#define vi vector<int> 
 class DSU{
     private:
         // p: keeps track of parent of i
         // depth: tracks the depth of i
         // setSize: size of each chunk(set)
-        vi p,depth,setSize;
+        vector<int> p,depth,setSize;
     public:
         //parameter : int n -> maximum number of items
         DSU(int n){
@@ -61,16 +62,35 @@ class DSU{
             }
             return false;
         }
+        void getParents(int i){
+            while(p[i]!=i){
+                cout << i << " ->";
+                i = p[i];
+            }
+            cout << p[i] << endl;
+        }
         
 };
 
 int main(){
-    //number of items
-    int n;cin>>n;
-
+    int n;
+    n = 10; 
+    //n: number of items
     DSU d(n+1);
-    //perform operations here
-    d.unionSet(2,4);
-    d.unionSet(3,4);
-    cout <<  d.findSet(2) <<endl;
+    d.unionSet(2,1); //performs union operation on 1 and 2
+    d.unionSet(1,4);
+    d.unionSet(8,1);
+    
+    d.unionSet(3,5);
+    d.unionSet(5,6);
+    d.unionSet(5,7);
+
+    d.unionSet(9,10);
+    d.unionSet(2,10);
+
+    //keeping track of the changes using parent pointers
+    d.getParents(7);
+    d.getParents(2);
+
+
 }