Merge branch 'master' of https://github.com/csresource04/leetcode-master

problems/0701.二叉搜索树中的插入操作.md

@@ -271,6 +271,20 @@ class Solution:
 
 
 Go：
+```Go
+func insertIntoBST(root *TreeNode, val int) *TreeNode {
+    if root == nil {
+        root = &TreeNode{Val: val}
+        return root
+    }
+    if root.Val > val {
+        root.Left = insertIntoBST(root.Left, val)
+    } else {
+        root.Right = insertIntoBST(root.Right, val)
+    }
+    return root
+}
+```