-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathsolution_test.go
76 lines (69 loc) · 1.04 KB
/
solution_test.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
65
66
67
68
69
70
71
72
73
74
75
76
package leetcode
import (
"testing"
)
func TestIsSameTree(t *testing.T) {
var ret bool
p := &TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
Right: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
}
q := &TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
Right: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
}
ret = true
if ret != isSameTree(p, q) {
t.Fatalf("case fails %v\n", ret)
}
p1 := &TreeNode{
Val: 1,
Left: nil,
Right: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
}
q1 := &TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
Right: &TreeNode{
Val: 2,
Left: nil,
Right: nil,
},
}
ret = false
if ret != isSameTree(p1, q1) {
t.Fatalf("case fails %v\n", ret)
}
p2 := &TreeNode{}
q2 := &TreeNode{}
ret = true
if ret != isSameTree(p2, q2) {
t.Fatalf("case fails %v\n", ret)
}
}