From dd11a104a48b4d63e8c479670fc38e26f70cb802 Mon Sep 17 00:00:00 2001
From: martisss <2466632626@qq.com>
Date: Thu, 2 Sep 2021 11:27:27 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A2=9E=E5=8A=A0530=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=90=9C=E7=B4=A2=E6=A0=91=E7=9A=84=E6=9C=80=E5=B0=8F=E7=BB=9D?=
 =?UTF-8?q?=E5=AF=B9=E5=B7=AE.md=20js=E9=80=92=E5=BD=92=E4=B8=8E=E8=BF=AD?=
 =?UTF-8?q?=E4=BB=A3=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0530.二叉搜索树的最小绝对差.md | 43 ++++++++++++++++++-
 1 file changed, 42 insertions(+), 1 deletion(-)

diff --git a/problems/0530.二叉搜索树的最小绝对差.md b/problems/0530.二叉搜索树的最小绝对差.md
index 46f6b796..ae6719ec 100644
--- a/problems/0530.二叉搜索树的最小绝对差.md
+++ b/problems/0530.二叉搜索树的最小绝对差.md
@@ -265,7 +265,7 @@ func getMinimumDifference(root *TreeNode) int {
 ```
 
 ## JavaScript 
-
+递归 先转换为有序数组
 ```javascript
 /**
  * Definition for a binary tree node.
@@ -297,6 +297,47 @@ var getMinimumDifference = function (root) {
     return diff;
 };
 ```
+递归 在递归的过程中更新最小值
+```js
+var getMinimumDifference = function(root) {
+    let res = Infinity
+    let preNode = null
+    // 中序遍历
+    const inorder = (node) => {
+        if(!node) return
+        inorder(node.left)
+        // 更新res
+        if(preNode) res = Math.min(res, node.val - preNode.val)
+        // 记录前一个节点         
+        preNode = node
+        inorder(node.right)
+    }
+    inorder(root)
+    return res
+}
+```
+
+迭代  中序遍历
+```js
+var getMinimumDifference = function(root) {
+    let stack = []
+    let cur = root
+    let res = Infinity
+    let pre = null
+    while(cur || stack.length) {
+        if(cur) {
+            stack.push(cur)
+            cur = cur.left
+        } else {
+            cur = stack.pop()
+            if(pre) res = Math.min(res, cur.val - pre.val)
+            pre = cur
+            cur = cur.right
+        }
+    }
+    return res
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)