From ad1faf8a150a8954661e39cbd25f0fdc1b1f8b5b Mon Sep 17 00:00:00 2001
From: kok-s0s <2694308562@qq.com>
Date: Fri, 25 Jun 2021 22:54:40 +0800
Subject: [PATCH] =?UTF-8?q?=E6=8F=90=E4=BE=9BJavaScript=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=E7=9A=84=E3=80=8A=E4=BA=8C=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91?=
 =?UTF-8?q?=E4=B8=AD=E7=9A=84=E6=8F=92=E5=85=A5=E6=93=8D=E4=BD=9C=E3=80=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0701.二叉搜索树中的插入操作.md | 77 +++++++++++++++++++
 1 file changed, 77 insertions(+)

diff --git a/problems/0701.二叉搜索树中的插入操作.md b/problems/0701.二叉搜索树中的插入操作.md
index 0f5b603a..794e0ae2 100644
--- a/problems/0701.二叉搜索树中的插入操作.md
+++ b/problems/0701.二叉搜索树中的插入操作.md
@@ -320,7 +320,84 @@ var insertIntoBST = function (root, val) {
 };
 ```
 
+> 无返回值的递归
 
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number} val
+ * @return {TreeNode}
+ */
+var insertIntoBST = function (root, val) {
+    let parent = new TreeNode(0);
+    const preOrder = (cur, val) => {
+        if (cur === null) {
+            let node = new TreeNode(val);
+            if (parent.val > val)
+                parent.left = node;
+            else
+                parent.right = node;
+            return;
+        }
+        parent = cur;
+        if (cur.val > val)
+            preOrder(cur.left, val);
+        if (cur.val < val)
+            preOrder(cur.right, val);
+    }
+    if (root === null)
+        root = new TreeNode(val);
+    preOrder(root, val);
+    return root;
+};
+```
+
+> 迭代
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number} val
+ * @return {TreeNode}
+ */
+var insertIntoBST = function (root, val) {
+    if (root === null) {
+        root = new TreeNode(val);
+    } else {
+        let parent = new TreeNode(0);
+        let cur = root;
+        while (cur) {
+            parent = cur;
+            if (cur.val > val)
+                cur = cur.left;
+            else
+                cur = cur.right;
+        }
+        let node = new TreeNode(val);
+        if (parent.val > val)
+            parent.left = node;
+        else
+            parent.right = node;
+    }
+    return root;
+};
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)