From 604c5d9b9f455e15eed2d5ec0b32f780fa4ff3aa Mon Sep 17 00:00:00 2001
From: Kshitiz Sharma <110187324+kshitiz11101@users.noreply.github.com>
Date: Thu, 16 May 2024 21:36:12 +0530
Subject: [PATCH] Create DivisibilityTree.cpp

---
 Graphs/DivisibilityTree.cpp | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 Graphs/DivisibilityTree.cpp

diff --git a/Graphs/DivisibilityTree.cpp b/Graphs/DivisibilityTree.cpp
new file mode 100644
index 0000000..c5b9c5a
--- /dev/null
+++ b/Graphs/DivisibilityTree.cpp
@@ -0,0 +1,29 @@
+
+class Solution {
+public:
+int dfs(int parent ,int node,vector<int>adj[],int &ans){
+    int count=0;
+    for(auto i:adj[node]){
+        if(i!=parent){
+            count+=dfs(node,i,adj,ans);
+        }
+    }
+    count++;
+    if(count%2==0 && node!=1){
+        ans++;
+        count=0;
+    }
+    return count;
+}
+	int minimumEdgeRemove(int n, vector<vector<int>>edges){
+	    // Code here
+	    vector<int>adj[n+1];
+	    for(auto i:edges){
+	        adj[i[0]].push_back(i[1]);
+	        adj[i[1]].push_back(i[0]);
+	    }
+	    int ans=0;
+	    dfs(-1,1,adj,ans);
+	    return ans;
+	}
+};