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

---
 problems/0102.二叉树的层序遍历.md | 40 ++++++++++++++---------
 1 file changed, 24 insertions(+), 16 deletions(-)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index f4a5c466..ed2c683d 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1426,28 +1426,36 @@ public:
 python代码：
 
 ```python
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
 class Solution:
-    """N叉树的层序遍历迭代法"""
-
     def levelOrder(self, root: 'Node') -> List[List[int]]:
-        results = []
         if not root:
-            return results
+            return []
 
-        from collections import deque
-        que = deque([root])
+        result = []
+        queue = collections.deque([root])
 
-        while que:
-            result = []
-            for _ in range(len(que)):
-                cur = que.popleft()
-                result.append(cur.val)
-                # cur.children 是 Node 对象组成的列表，也可能为 None
-                if cur.children:
-                    que.extend(cur.children)
-            results.append(result)
+        while queue:
+            level_size = len(queue)
+            level = []
 
-        return results
+            for _ in range(level_size):
+                node = queue.popleft()
+                level.append(node.val)
+
+                for child in node.children:
+                    queue.append(child)
+
+            result.append(level)
+
+        return result
 ```
 
 ```python