From bf7597facfb1f993024ff932fabe6f0bf5198b31 Mon Sep 17 00:00:00 2001
From: kok-s0s <2694308562@qq.com>
Date: Wed, 23 Jun 2021 21:49:11 +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=95=B0?=
 =?UTF-8?q?=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC=E5=85=B1=E7=A5=96=E5=85=88?=
 =?UTF-8?q?=E3=80=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...35.二叉搜索树的最近公共祖先.md | 55 +++++++++++++++++++
 1 file changed, 55 insertions(+)

diff --git a/problems/0235.二叉搜索树的最近公共祖先.md b/problems/0235.二叉搜索树的最近公共祖先.md
index d78db42a..a893c191 100644
--- a/problems/0235.二叉搜索树的最近公共祖先.md
+++ b/problems/0235.二叉搜索树的最近公共祖先.md
@@ -314,7 +314,62 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
 ```
 
 
+JavaScript版本
+> 递归
 
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {TreeNode}
+ */
+var lowestCommonAncestor = function(root, p, q) {
+    if(root.val > p.val && root.val > q.val)
+        return lowestCommonAncestor(root.left, p , q);
+    else if(root.val < p.val && root.val < q.val) 
+        return lowestCommonAncestor(root.right, p , q);
+    return root;
+};
+```
+
+> 迭代
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {TreeNode}
+ */
+var lowestCommonAncestor = function(root, p, q) {
+    while(1) {
+        if(root.val > p.val && root.val > q.val)
+            root = root.left;
+        else if(root.val < p.val && root.val < q.val)
+            root = root.right;
+        else
+            break;
+    }
+    return root;
+};
+```
 
 
 -----------------------