From 891bf6a7eb92cb54eec4fa1d4a7ee0fcd1448fdb Mon Sep 17 00:00:00 2001
From: "xeniaxie(xl)" <xeniaxie@jintengtech.com>
Date: Sat, 3 Jul 2021 16:10:02 +0800
Subject: [PATCH] =?UTF-8?q?669=E4=BF=AE=E5=89=AA=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=90=9C=E7=B4=A2=E6=A0=91JavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0669.修剪二叉搜索树.md | 53 ++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)

diff --git a/problems/0669.修剪二叉搜索树.md b/problems/0669.修剪二叉搜索树.md
index 06d99b9d..e20c3cea 100644
--- a/problems/0669.修剪二叉搜索树.md
+++ b/problems/0669.修剪二叉搜索树.md
@@ -289,6 +289,59 @@ Go：
 
 
 
+JavaScript版本：
+迭代：
+```js
+var trimBST = function(root, low, high) {
+   if(root === null) {
+       return null;
+   }
+   while(root !==null &&(root.val<low||root.val>high)) {
+       if(root.val<low) {
+           root = root.right;
+       }else {
+           root = root.left;
+       }
+   }
+   let cur = root;
+   while(cur!==null) {
+       while(cur.left&&cur.left.val<low) {
+           cur.left = cur.left.right;
+       }
+       cur = cur.left;
+   }
+   cur =  root;
+   //判断右子树大于high的情况
+   while(cur!==null) {
+       while(cur.right&&cur.right.val>high) {
+           cur.right = cur.right.left;
+       }
+       cur = cur.right;
+   }
+   return root;
+};
+```
+
+递归：
+```js
+var trimBST = function (root,low,high) { 
+    if(root === null) {
+        return null;
+    }
+    if(root.val<low) {
+        let right = trimBST(root.right,low,high);
+        return right;
+    }
+    if(root.val>high) {
+        let left = trimBST(root.left,low,high);
+        return left;
+    }
+    root.left = trimBST(root.left,low,high);
+    root.right = trimBST(root.right,low,high);
+    return root;
+ }
+```
+
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)