-
Notifications
You must be signed in to change notification settings - Fork 2
/
validatebinarysearchtree_test.go
120 lines (116 loc) · 2.07 KB
/
validatebinarysearchtree_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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
package validatebinarysearchtree
import (
"testing"
"github.com/WindomZ/testify/assert"
)
func Test_isValidBST(t *testing.T) {
assert.True(t, isValidBST(nil))
assert.False(t, isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 1,
},
}))
assert.True(t, isValidBST(&TreeNode{
Val: 1,
Right: &TreeNode{
Val: 2,
Right: &TreeNode{Val: 3},
},
}))
assert.True(t, isValidBST(&TreeNode{
Val: 2,
Left: &TreeNode{Val: 1},
Right: &TreeNode{Val: 3},
}))
assert.False(t, isValidBST(&TreeNode{
Val: 1,
Right: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 2},
},
}))
assert.False(t, isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 2},
},
}))
assert.False(t, isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{Val: 2},
Right: &TreeNode{Val: 3},
}))
assert.False(t, isValidBST(&TreeNode{
Val: 2,
Left: &TreeNode{Val: 3},
Right: &TreeNode{Val: 1},
}))
assert.False(t, isValidBST(&TreeNode{
Val: 2,
Right: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 1},
},
}))
}
func Benchmark_isValidBST(b *testing.B) {
b.StopTimer()
b.ReportAllocs()
b.StartTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
isValidBST(nil)
isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 1,
},
})
isValidBST(&TreeNode{
Val: 1,
Right: &TreeNode{
Val: 2,
Right: &TreeNode{Val: 3},
},
})
isValidBST(&TreeNode{
Val: 2,
Left: &TreeNode{Val: 1},
Right: &TreeNode{Val: 3},
})
isValidBST(&TreeNode{
Val: 1,
Right: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 2},
},
})
isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 2},
},
})
isValidBST(&TreeNode{
Val: 1,
Left: &TreeNode{Val: 2},
Right: &TreeNode{Val: 3},
})
isValidBST(&TreeNode{
Val: 2,
Left: &TreeNode{Val: 3},
Right: &TreeNode{Val: 1},
})
isValidBST(&TreeNode{
Val: 2,
Right: &TreeNode{
Val: 3,
Right: &TreeNode{Val: 1},
},
})
}
})
}