From 2c462a6a78cf4e71abe536dd310380eaca697b29 Mon Sep 17 00:00:00 2001
From: WSL0809 <48207171+WSL0809@users.noreply.github.com>
Date: Sat, 24 Dec 2022 22:19:54 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E5=B1=82=E5=BA=8F?=
 =?UTF-8?q?=E9=81=8D=E5=8E=86=20python=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 docs/chapter_tree/binary_tree_traversal.md | 21 ++++++++++++++++++++-
 1 file changed, 20 insertions(+), 1 deletion(-)

diff --git a/docs/chapter_tree/binary_tree_traversal.md b/docs/chapter_tree/binary_tree_traversal.md
index 971d24cc5..fb80374f3 100644
--- a/docs/chapter_tree/binary_tree_traversal.md
+++ b/docs/chapter_tree/binary_tree_traversal.md
@@ -65,7 +65,26 @@ comments: true
 === "Python"
 
     ```python title="binary_tree_bfs.py"
-    
+       def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
+        // 初始化一个列表，用于保存遍历序列
+        result = []
+        if not root :
+            return result
+        from collections import deque
+        // 初始化队列，加入根结点
+        queue = deque([root])
+        while queue:
+            list = []
+            size = len(queue)
+            for _ in range(size):
+                cur = queue.popleft()
+                list.append(cur.val)
+                if cur.left:
+                    queue.append(cur.left)
+                if cur.right:
+                    queue.append(cur.right)
+            result.append(list)
+        return result
     ```
 
 === "Go"