Update 二叉树的迭代遍历.md

problems/二叉树的迭代遍历.md

@@ -258,6 +258,8 @@ class Solution:
             if node.left:
                 stack.append(node.left)
         return result
+```
+```python
 
 # 中序遍历-迭代-LC94_二叉树的中序遍历
 class Solution:
@@ -279,6 +281,8 @@ class Solution:
                 # 取栈顶元素右结点
                 cur = cur.right	
         return result
+ ```
+ ```python
 
 # 后序遍历-迭代-LC145_二叉树的后序遍历
 class Solution: