-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdelete-leaves-with-a-given-value.go
64 lines (55 loc) · 1.28 KB
/
delete-leaves-with-a-given-value.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
57
58
59
60
61
62
63
64
package main
import (
"fmt"
. "github.com/dimaglushkov/solutions/ADS/tree"
)
func removeLeafNodes(root *TreeNode, target int) *TreeNode {
if root.Left != nil {
root.Left = removeLeafNodes(root.Left, target)
}
if root.Right != nil {
root.Right = removeLeafNodes(root.Right, target)
}
if root.Left == nil && root.Right == nil && root.Val == target {
return nil
}
return root
}
func main() {
testCases := []struct {
root *TreeNode
target int
want *TreeNode
}{
{
root: NewTreeNode([]int{1, 2, 3, 2, -1, 2, 4}),
target: 2,
want: NewTreeNode([]int{1, -1, 3, -1, 4}),
},
{
root: NewTreeNode([]int{1, 3, 3, 3, 2}),
target: 3,
want: NewTreeNode([]int{1, 3, -1, -1, 2}),
},
{
root: NewTreeNode([]int{1, 2, -1, 2, -1, 2}),
target: 2,
want: NewTreeNode([]int{1}),
},
}
successes := 0
for _, tc := range testCases {
x := removeLeafNodes(tc.root, tc.target)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}