From fa6c8d2e98240323085e9970c5016a951f916eff Mon Sep 17 00:00:00 2001
From: ray <109325327+raydemo1@users.noreply.github.com>
Date: Wed, 8 May 2024 18:45:21 +0800
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=20Python?=
 =?UTF-8?q?=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86=E9=80=92=E5=BD=92=E6=B3=95?=
 =?UTF-8?q?=E6=9B=B4=E7=AE=80=E6=B4=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index ab6b07bf..cdc7a783 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -201,7 +201,7 @@ class Solution:
         return result
 ```
 ```python
-# 递归法
+#递归法
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):
@@ -210,18 +210,24 @@ class Solution:
 #         self.right = right
 class Solution:
     def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
+        if not root:
+            return []
+
         levels = []
-        self.helper(root, 0, levels)
+
+        def traverse(node, level):
+            if not node:
+                return
+
+            if len(levels) == level:
+                levels.append([])
+
+            levels[level].append(node.val)
+            traverse(node.left, level + 1)
+            traverse(node.right, level + 1)
+
+        traverse(root, 0)
         return levels
-    
-    def helper(self, node, level, levels):
-        if not node:
-            return
-        if len(levels) == level:
-            levels.append([])
-        levels[level].append(node.val)
-        self.helper(node.left, level + 1, levels)
-        self.helper(node.right, level + 1, levels)
 
 ```