Update: test

Author: openset

problems/convert-sorted-array-to-binary-search-tree/convert_sorted_array_to_binary_search_tree.go

@@ -1,6 +1,8 @@
 package convert_sorted_array_to_binary_search_tree
 
-import . "github.com/openset/leetcode/internal/kit"
+import "github.com/openset/leetcode/internal/kit"
+
+type TreeNode = kit.TreeNode
 
 /**
  * Definition for a binary tree node.

problems/convert-sorted-array-to-binary-search-tree/convert_sorted_array_to_binary_search_tree_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	. "github.com/openset/leetcode/internal/kit"
+	"github.com/openset/leetcode/internal/kit"
 )
 
 type caseType struct {
@@ -16,11 +16,11 @@ func TestSortedArrayToBST(t *testing.T) {
 	tests := [...]caseType{
 		{
 			input:    []int{-10, -3, 0, 5, 9},
-			expected: []int{0, -3, 9, -10, 5},
+			expected: []int{0, -3, 9, -10, kit.NULL, 5},
 		},
 	}
 	for _, tc := range tests {
-		output := TreeNode2SliceInt(sortedArrayToBST(tc.input))
+		output := kit.TreeNode2SliceInt(sortedArrayToBST(tc.input))
 		if !reflect.DeepEqual(output, tc.expected) {
 			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
 		}