fix: improve coverage size

Author: plh97

algorithm/1008.ConstructBinarySearchTreefromPreorderTraversal/main_test.go

@@ -16,6 +16,10 @@ var tcs = []struct {
 		[]int{8, 5, 1, 7, 10, 12},
 		Helper.Ints2TreeNode([]int{8, 5, 10, 1, 7, -1 << 63, 12}),
 	},
+	{
+		[]int{},
+		Helper.Ints2TreeNode([]int{}),
+	},
 }
 
 func Test_bitwiseComplement(t *testing.T) {

algorithm/1110.DeleteNodesAndReturnForest/main.go

@@ -51,12 +51,3 @@ func delNodes(root *TreeNode, to_delete []int) []*TreeNode {
 
 	return res
 }
-
-func include(nums []int, val int) bool {
-	for i := range nums {
-		if nums[i] == val {
-			return true
-		}
-	}
-	return false
-}

algorithm/450.DeleteNodeaBST/main_test.go

@@ -18,16 +18,16 @@ var tcs = []struct {
 	// 	3,
 	// 	Helper.Ints2TreeNode([]int{5, 2, 6, -1 << 63, 4, -1 << 63, 7}),
 	// },
-	// {
-	// 	Helper.Ints2TreeNode([]int{0}),
-	// 	0,
-	// 	Helper.Ints2TreeNode([]int{}),
-	// },
-	// {
-	// 	Helper.Ints2TreeNode([]int{1, -1 << 63, 2}),
-	// 	1,
-	// 	Helper.Ints2TreeNode([]int{2}),
-	// },
+	{
+		Helper.Ints2TreeNode([]int{0}),
+		0,
+		Helper.Ints2TreeNode([]int{}),
+	},
+	{
+		Helper.Ints2TreeNode([]int{1, -1 << 63, 2}),
+		1,
+		Helper.Ints2TreeNode([]int{2}),
+	},
 	{
 		Helper.Ints2TreeNode([]int{3, 1, 4, -1 << 63, 2}),
 		3,