Update solution 0700

leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go

@@ -1,10 +1,20 @@
 package leetcode
 
-type TreeNode struct {
-	Val   int
-	Left  *TreeNode
-	Right *TreeNode
-}
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
 
 func searchBST(root *TreeNode, val int) *TreeNode {
 	if root == nil {