Added 1 solution

varunu28 · varunu28 · commit 13f13ea15442 · 2019-12-02T20:34:46.000-08:00
diff --git a/Medium/Delete Tree Nodes.java b/Medium/Delete Tree Nodes.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int deleteTreeNodes(int nodes, int[] parent, int[] value) {
+        for (int i = nodes - 1; i > 0; i--) {
+            value[parent[i]] += value[i];
+        }
+        Set<Integer> set = new HashSet<>();
+        for (int i = 0; i < nodes; i++) {
+            if (set.contains(parent[i])) {
+                value[i] = 0;
+            }
+            if (value[i] == 0) {
+                set.add(i);
+            }
+        }
+        return nodes - set.size();
+    }
+}
