You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: 99. Recover Binary Search Tree_test.go
    path of file: ./repos/LeetCode-Go/leetcode/0099.Recover-Binary-Search-Tree
    
    the code of the file until where you have to start completion: package leetcode

import (
	"fmt"
	"testing"

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

type question99 struct {
	para99
	ans99
}

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

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

func Test_Problem99(t *testing.T) {

	qs := []question99{

		{
			para99{[]int{1, 3, structures.NULL, structures.NULL, 2}},
			ans99{[]int{3, 1, structures.NULL, structures.NULL, 2}},
		},

		{
			para99{[]int{3, 1, 4, structures.NULL, structures.NULL, 2}},
			ans99{[]int{2, 1, 4, structu
    
func Test_Problem99(t *testing.T) {

	qs := []question99{

		{
			para99{[]int{1, 3, structures.NULL, structures.NULL, 2}},
			ans99{[]int{3, 1, structures.NULL, structures.NULL, 2}},
		},

		{
			para99{[]int{3, 1, 4, structures.NULL, structures.NULL, 2}},
			ans99{[]int{2, 1, 4, structures.NULL, structures.NULL, 3}},
		},
	}

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

	for _, q := range qs {
		_, p := q.ans99, q.para99
		fmt.Printf("【input】:%v      ", p)
		rootOne := structures.Ints2TreeNode(p.one)
		recoverTree(rootOne)
		fmt.Printf("【output】:%v      \n", p)
	}
	fmt.Printf("\n\n\n")
}