add new solutions

solutions/0/q94/solution.go

@@ -0,0 +1,25 @@
+package q94
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func traversal(node *TreeNode, ret *[]int) {
+	if node == nil {
+		return
+	}
+	traversal(node.Left, ret)
+	*ret = append(*ret, node.Val)
+	traversal(node.Right, ret)
+}
+
+func inorderTraversal(root *TreeNode) []int {
+	// left, center, right
+	ret := []int{}
+	traversal(root, &ret)
+	return ret
+}
+
+var _ = inorderTraversal