From ce5b335b7258b7febb2dc831d68bfd3bb6161905 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Wed, 3 May 2023 19:30:53 -0500
Subject: [PATCH] =?UTF-8?q?Update=20=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E8=BF=AD=E4=BB=A3=E9=81=8D=E5=8E=86.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树的迭代遍历.md | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/problems/二叉树的迭代遍历.md b/problems/二叉树的迭代遍历.md
index 35cf4077..8b241465 100644
--- a/problems/二叉树的迭代遍历.md
+++ b/problems/二叉树的迭代遍历.md
@@ -258,7 +258,9 @@ class Solution:
             if node.left:
                 stack.append(node.left)
         return result
-        
+```
+```python
+
 # 中序遍历-迭代-LC94_二叉树的中序遍历
 class Solution:
     def inorderTraversal(self, root: TreeNode) -> List[int]:
@@ -279,7 +281,9 @@ class Solution:
                 # 取栈顶元素右结点
                 cur = cur.right	
         return result
-        
+ ```
+ ```python
+
 # 后序遍历-迭代-LC145_二叉树的后序遍历
 class Solution:
     def postorderTraversal(self, root: TreeNode) -> List[int]: