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

---
 problems/二叉树的递归遍历.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 8d5a5985..92f342f0 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -191,7 +191,8 @@ class Solution:
 
         return  [root.val] + left +  right
 
-
+```
+```python
 # 中序遍历-递归-LC94_二叉树的中序遍历
 class Solution:
     def inorderTraversal(self, root: TreeNode) -> List[int]:
@@ -202,6 +203,9 @@ class Solution:
         right = self.inorderTraversal(root.right)
 
         return left + [root.val] + right
+```
+```python
+
 
 # 后序遍历-递归-LC145_二叉树的后序遍历
 class Solution: