109 adding

Author: aQua

Algorithms/0109.convert-sorted-list-to-binary-search-tree/README.md

@@ -0,0 +1,8 @@
+# [109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)
+
+## 题目
+Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
+
+## 解题思路
+
+见程序注释

Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.go

@@ -0,0 +1,12 @@
+package Problem0109
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Golang/kit"
+)
+
+type ListNode = kit.ListNode
+type TreeNode = kit.TreeNode
+
+func sortedListToBST(head *ListNode) *TreeNode {
+
+}

Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go

@@ -0,0 +1,37 @@
+package Problem0109
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func Test_Problem0109(t *testing.T) {
+	ast := assert.New(t)
+
+	// tcs is testcase slice
+	tcs := []struct {
+		head []int
+		ans  []int
+	}{
+
+		{
+			[]int{},
+			nil,
+		},
+
+		{
+			[]int{1, 2, 3, 4, 5, 6, 7, 8},
+			[]int{1, 2, 3, 4, 5, 6, 7, 8},
+		},
+
+		// 可以多个 testcase
+	}
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+
+		ast.Equal(tc.ans, sortedListToBST(tc.head), "输入:%v", tc)
+	}
+}