层序遍历

Author: chenpengcode

tree/116_connect.py

@@ -0,0 +1,36 @@
+import collections
+
+
+# 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
+
+        q = collections.deque()
+        q.append(root)
+
+        while q:
+            cnt = len(q)
+            last = q[0]
+
+            for i in range(cnt):
+                node = q.popleft()
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+                if i != 0:
+                    last.next = node
+                last = node
+
+        return root