From e9c91e78998bde1a123865df30aca4071bba8159 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Mon, 31 May 2021 10:55:43 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84=E7=BB=9F?=
 =?UTF-8?q?=E4=B8=80=E8=BF=AD=E4=BB=A3=E6=B3=95=20javaScript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树的统一迭代法.md | 80 +++++++++++++++++++++++++
 1 file changed, 80 insertions(+)

diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
index dca5d3e3..f4091ad5 100644
--- a/problems/二叉树的统一迭代法.md
+++ b/problems/二叉树的统一迭代法.md
@@ -374,6 +374,86 @@ func postorderTraversal(root *TreeNode) []int {
 }
 ```
 
+javaScript:
+
+> 前序遍历统一迭代法
+
+```js
+
+// 前序遍历：中左右
+// 压栈顺序：右左中
+
+var preorderTraversal = function(root, res = []) {
+    const stack = [];
+    if (root) stack.push(root);
+    while(stack.length) {
+        const node = stack.pop();
+        if(!node) {
+            res.push(stack.pop().val);
+            continue;
+        }
+        if (node.right) stack.push(node.right); // 右
+        if (node.left) stack.push(node.left); // 左
+        stack.push(node); // 中
+        stack.push(null);
+    };
+    return res;
+};
+
+```
+
+> 中序遍历统一迭代法
+
+```js
+
+//  中序遍历：左中右
+//  压栈顺序：右中左
+ 
+var inorderTraversal = function(root, res = []) {
+    const stack = [];
+    if (root) stack.push(root);
+    while(stack.length) {
+        const node = stack.pop();
+        if(!node) {
+            res.push(stack.pop().val);
+            continue;
+        }
+        if (node.right) stack.push(node.right); // 右
+        stack.push(node); // 中
+        stack.push(null);
+        if (node.left) stack.push(node.left); // 左
+    };
+    return res;
+};
+
+```
+
+> 后序遍历统一迭代法
+
+```js
+
+// 后续遍历：左右中
+// 压栈顺序：中右左
+ 
+var postorderTraversal = function(root, res = []) {
+    const stack = [];
+    if (root) stack.push(root);
+    while(stack.length) {
+        const node = stack.pop();
+        if(!node) {
+            res.push(stack.pop().val);
+            continue;
+        }
+        stack.push(node); // 中
+        stack.push(null);
+        if (node.right) stack.push(node.right); // 右
+        if (node.left) stack.push(node.left); // 左
+    };
+    return res;
+};
+
+```
+
 
 
 -----------------------