From 65085c4e9bcf8c478fe67caad7dd0dceaa5911e0 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Wed, 3 May 2023 20:10:51 -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 | 44 ++++++++++++++++-------
 1 file changed, 32 insertions(+), 12 deletions(-)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 47969b25..89e7a126 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -2381,21 +2381,41 @@ python代码：
 
 ```python
 # 层序遍历解法
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
+        self.val = val
+        self.left = left
+        self.right = right
+        self.next = next
+"""
+
 class Solution:
     def connect(self, root: 'Node') -> 'Node':
         if not root:
-            return None
-        queue = [root]
-        while queue:  # 遍历每一层
-            length = len(queue)
-            tail = None # 每一层维护一个尾节点
-            for i in range(length): # 遍历当前层
-                curnode = queue.pop(0)
-                if tail:
-                    tail.next = curnode # 让尾节点指向当前节点
-                tail = curnode # 让当前节点成为尾节点
-                if curnode.left : queue.append(curnode.left)
-                if curnode.right: queue.append(curnode.right)
+            return root
+        
+        queue = collections.deque([root])
+        
+        while queue:
+            level_size = len(queue)
+            prev = None
+            
+            for i in range(level_size):
+                node = queue.popleft()
+                
+                if prev:
+                    prev.next = node
+                
+                prev = node
+                
+                if node.left:
+                    queue.append(node.left)
+                
+                if node.right:
+                    queue.append(node.right)
+        
         return root
 
 ```