-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDeleteNodesAndReturnForest.java
More file actions
64 lines (56 loc) · 2.07 KB
/
DeleteNodesAndReturnForest.java
File metadata and controls
64 lines (56 loc) · 2.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package solutions;
import datastructure.TreeNode;
import java.util.*;
import java.util.stream.Collectors;
// [Problem] https://leetcode.com/problems/delete-nodes-and-return-forest
class DeleteNodesAndReturnForest {
// DFS
// O(n) time, O(n) space
public List<TreeNode> delNodes(TreeNode root, int[] toDelete) {
Set<Integer> nodesToDelete = Arrays.stream(toDelete).boxed().collect(Collectors.toSet());
List<TreeNode> forest = new ArrayList<>();
if (!nodesToDelete.contains(root.val)) {
forest.add(root);
}
deleteNodes(root, nodesToDelete, forest);
return forest;
}
private TreeNode deleteNodes(TreeNode node, Set<Integer> nodesToDelete, List<TreeNode> forest) {
if (node == null) {
return null;
}
node.left = deleteNodes(node.left, nodesToDelete, forest);
node.right = deleteNodes(node.right, nodesToDelete, forest);
if (nodesToDelete.contains(node.val)) {
if (node.left != null) {
forest.add(node.left);
}
if (node.right != null) {
forest.add(node.right);
}
return null;
}
return node;
}
// Test
public static void main(String[] args) {
DeleteNodesAndReturnForest solution = new DeleteNodesAndReturnForest();
// Given input tree:
// 1
// / \
// 2 3
// / \ / \
// 4 5 6 7
TreeNode root = new TreeNode(1,
new TreeNode(2, new TreeNode(4), new TreeNode(5)),
new TreeNode(3, new TreeNode(6), new TreeNode(7)));
int[] toDelete = {3, 5};
List<TreeNode> expectedOutput = List.of(
new TreeNode(1, new TreeNode(2, new TreeNode(4), null), null),
new TreeNode(6),
new TreeNode(7));
List<TreeNode> actualOutput = solution.delNodes(root, toDelete);
System.out.println(actualOutput);
System.out.println("Test passed? " + expectedOutput.equals(actualOutput));
}
}