binary-tree-level-order-traversal-ii_test.go

package Problem0107

import (
	"fmt"
	"testing"

	"github.com/aQuaYi/LeetCode-in-Golang/kit"
	"github.com/stretchr/testify/assert"
)

func Test_Problem0107(t *testing.T) {
	ast := assert.New(t)

	// tcs is testcase slice
	tcs := []struct {
		pre, in []int
		ans     [][]int
	}{

		{
			[]int{3, 9, 20, 15, 7},
			[]int{9, 3, 15, 20, 7},
			[][]int{
				[]int{15, 7},
				[]int{9, 20},
				[]int{3},
			},
		},

		// 可以多个 testcase
	}

	for _, tc := range tcs {
		fmt.Printf("~~%v~~\n", tc)

		ast.Equal(tc.ans, levelOrderBottom(kit.PreIn2Tree(tc.pre, tc.in)), "输入:%v", tc)
	}
}