Update solution 0700

halfrost · dezhiy · commit 8ff3546b5d78 · 2021-11-26T05:21:49.000-08:00
diff --git a/leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go b/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 {
diff --git a/leetcode/0700.Search-in-a-Binary-Search-Tree/README.md b/leetcode/0700.Search-in-a-Binary-Search-Tree/README.md
@@ -1,4 +1,4 @@
-# [700. Search in a Binary Search Tree](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)
+# [700. Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)
 
 ## 题目
 
@@ -38,13 +38,24 @@ Find the node in the BST that the node's value equals val and return the subtree
 ## 代码
 
 ```go
+
 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 {
@@ -58,4 +69,5 @@ func searchBST(root *TreeNode, val int) *TreeNode {
 		return searchBST(root.Left, val)
 	}
 }
+
 ```
