From 95616fa9a8a147f3255ead5523af0a4de51844b9 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Wed, 3 May 2023 20:03:09 -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 | 47 ++++++++++++++---------
 1 file changed, 29 insertions(+), 18 deletions(-)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index fdfde822..f4a5c466 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1121,27 +1121,38 @@ python代码：
 class Solution:
     """二叉树层平均值迭代解法"""
 
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
     def averageOfLevels(self, root: TreeNode) -> List[float]:
-        results = []
         if not root:
-            return results
+            return []
 
-        from collections import deque
-        que = deque([root])
-
-        while que:
-            size = len(que)
-            sum_ = 0
-            for _ in range(size):
-                cur = que.popleft()
-                sum_ += cur.val
-                if cur.left:
-                    que.append(cur.left)
-                if cur.right:
-                    que.append(cur.right)
-            results.append(sum_ / size)
-
-        return results
+        queue = collections.deque([root])
+        averages = []
+        
+        while queue:
+            size = len(queue)
+            level_sum = 0
+            
+            for i in range(size):
+                node = queue.popleft()
+                
+                
+                level_sum += node.val
+                    
+                if node.left:
+                    queue.append(node.left)
+                if node.right:
+                    queue.append(node.right)
+            
+            averages.append(level_sum / size)
+        
+        return averages
 ```
 
 java: