From 0df3cb05501a0fc9cbc7e3867ccba4e6f5ba33f4 Mon Sep 17 00:00:00 2001
From: MWang <48111863+mouWorks@users.noreply.github.com>
Date: Wed, 25 Jan 2023 12:35:45 +0800
Subject: [PATCH] Fix : TypeScript answer

* Fixing TypeScript traversal answers
- preoder / inorder / postorder has exactly same code, fixed.
---
 problems/二叉树的统一迭代法.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
index c44bbb99..27464269 100644
--- a/problems/二叉树的统一迭代法.md
+++ b/problems/二叉树的统一迭代法.md
@@ -536,9 +536,9 @@ function preorderTraversal(root: TreeNode | null): number[] {
         curNode = helperStack.pop()!;
         if (curNode !== null) {
             if (curNode.right !== null) helperStack.push(curNode.right);
+	    if (curNode.left !== null) helperStack.push(curNode.left);
             helperStack.push(curNode);
             helperStack.push(null);
-            if (curNode.left !== null) helperStack.push(curNode.left);
         } else {
             curNode = helperStack.pop()!;
             res.push(curNode.val);
@@ -579,9 +579,9 @@ function postorderTraversal(root: TreeNode | null): number[] {
     while (helperStack.length > 0) {
         curNode = helperStack.pop()!;
         if (curNode !== null) {
-            if (curNode.right !== null) helperStack.push(curNode.right);
-            helperStack.push(curNode);
+	    helperStack.push(curNode);
             helperStack.push(null);
+            if (curNode.right !== null) helperStack.push(curNode.right);
             if (curNode.left !== null) helperStack.push(curNode.left);
         } else {
             curNode = helperStack.pop()!;