-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlargest_node_level_test.go
55 lines (45 loc) · 1.06 KB
/
largest_node_level_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
package problem0515
import (
"fmt"
. "leetcodedaily/helpers/binarytree"
"testing"
"github.com/stretchr/testify/assert"
)
type Result struct {
Input *TreeNode
Expected []int
}
var Results = []Result{
{MakeTree(1, 3, 5, NULL, NULL, 3, NULL, NULL, 2, NULL, 9, NULL, NULL), []int{1, 3, 9}},
{MakeTree(1, 2, NULL, NULL, 3, NULL, NULL), []int{1, 3}},
}
func TestLargestNodeLevel(t *testing.T) {
assert := assert.New(t)
for _, res := range Results {
want := res.Expected
got := largestValues(res.Input)
assert.Equal(want, got, fmt.Sprintf("%+v", res))
}
}
func BenchmarkLargestNodeLevel(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, res := range Results {
largestValues(res.Input)
}
}
}
func TestLargestNodeLevelRec(t *testing.T) {
assert := assert.New(t)
for _, res := range Results {
want := res.Expected
got := largestValuesRec(res.Input)
assert.Equal(want, got, fmt.Sprintf("%+v", res))
}
}
func BenchmarkLargestNodeLevelRec(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, res := range Results {
largestValuesRec(res.Input)
}
}
}