LeetCode-Go/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree_test.go

package leetcode

import (
	"fmt"
	"testing"

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

type question987 struct {
	para987
	ans987
}

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

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

func Test_Problem987(t *testing.T) {

	qs := []question987{

		{
			para987{[]int{3, 9, 20, structures.NULL, structures.NULL, 15, 7}},
			ans987{[][]int{{9}, {3, 15}, {20}, {7}}},
		},

		{
			para987{[]int{1, 2, 3, 4, 5, 6, 7}},
			ans987{[][]int{{4}, {2}, {1, 5, 6}, {3}, {7}}},
		},

		{
			para987{[]int{1, 2, 3, 4, 6, 5, 7}},
			ans987{[][]int{{4}, {2}, {1, 5, 6}, {3}, {7}}},
		},
	}

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

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