From 7fe06286dbdcefcdbfe494e190b04c4c4a481200 Mon Sep 17 00:00:00 2001
From: wsl <wslzzy@qq.com>
Date: Mon, 26 Dec 2022 21:55:15 +0800
Subject: [PATCH] =?UTF-8?q?python=20=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86?=
 =?UTF-8?q?=E6=96=87=E6=A1=A3=E7=BC=96=E5=86=99?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

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