-
Notifications
You must be signed in to change notification settings - Fork 3
/
solution.go
56 lines (45 loc) · 1.21 KB
/
solution.go
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
package main
import "fmt"
// TreeNode is a binary tree node.
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func delNodes(root *TreeNode, toDelete []int) []*TreeNode {
var remaining []*TreeNode
m := make(map[int]struct{})
// save value to delete into a hash set
for _, v := range toDelete {
m[v] = struct{}{}
}
// recursively remove nodes
removeNodes(root, m, &remaining)
// append the root node to remaining if root is not in toDelete
if _, ok := m[root.Val]; !ok {
remaining = append(remaining, root)
}
return remaining
}
func removeNodes(root *TreeNode, m map[int]struct{}, remaining *[]*TreeNode) *TreeNode {
if root == nil {
return nil
}
root.Left = removeNodes(root.Left, m, remaining)
root.Right = removeNodes(root.Right, m, remaining)
if _, ok := m[root.Val]; ok {
if root.Left != nil {
*remaining = append(*remaining, root.Left)
}
if root.Right != nil {
*remaining = append(*remaining, root.Right)
}
return nil
}
return root
}
func main() {
root := &TreeNode{1, &TreeNode{2, &TreeNode{4, nil, nil}, &TreeNode{5, nil, nil}}, &TreeNode{5, &TreeNode{6, nil, nil}, &TreeNode{7, nil, nil}}}
toDelete := []int{5, 3}
fmt.Println(delNodes(root, toDelete))
}