Merge pull request #641 from Steve0x2a/patch-1

修改0102二叉树的层序遍历Python代码
2025-07-09 03:34:02 +08:00 · 2021-08-24 09:23:50 +08:00
parent 57c1ee8375 c619a05139
commit cf6edd67cd
1 changed files with 2 additions and 2 deletions
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@ -93,10 +93,10 @@ class Solution:
        if not root:
            return []
-        quene = [root]
+        queue = [root]
        out_list = []
-        while quene:
+        while queue:
            length = len(queue)  
            in_list = []
            for _ in range(length):