103. Binary Tree Zigzag Level Order Traversal_test.go

package leetcode

import (
	"fmt"
	"testing"

	"github.com/halfrost/LeetCode-Go/structures"
)

type question103 struct {
	para103
	ans103
}

// para 是参数
// one 代表第一个参数
type para103 struct {
	one []int
}

// ans 是答案
// one 代表第一个答案
type ans103 struct {
	one [][]int
}

func Test_Problem103(t *testing.T) {

	qs := []question103{

		question103{
			para103{[]int{}},
			ans103{[][]int{}},
		},

		question103{
			para103{[]int{1}},
			ans103{[][]int{[]int{1}}},
		},

		question103{
			para103{[]int{3, 9, 20, structures.NULL, structures.NULL, 15, 7}},
			ans103{[][]int{[]int{3}, []int{9, 20}, []int{15, 7}}},
		},

		question103{
			para103{[]int{1, 2, 3, 4, structures.NULL, structures.NULL, 5}},
			ans103{[][]int{[]int{1}, []int{3, 2}, []int{4, 5}}},
		},
	}

	fmt.Printf("------------------------Leetcode Problem 103------------------------\n")

	for _, q := range qs {
		_, p := q.ans103, q.para103
		fmt.Printf("【input】:%v      ", p)
		root := structures.Ints2TreeNode(p.one)
		fmt.Printf("【output】:%v      \n", zigzagLevelOrder(root))
	}
	fmt.Printf("\n\n\n")
}