leetcode.com 117. Populating Next Right Pointers in Each Node II

문제 링크: https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii

Author: skysign

leetcode.com 117. Populating Next Right Pointers in Each Node II/main.py

@@ -0,0 +1,35 @@
+from typing import Dict
+
+# 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 root is None:
+            return root
+
+        dict = {}
+        self.postorder(root, 0, dict)
+        return root
+
+    def postorder(self, node, level: int, dict: Dict):
+        node.next = None
+
+        if node.left:
+            self.postorder(node.left, level + 1, dict)
+
+        if node.right:
+            self.postorder(node.right, level + 1, dict)
+
+        if level in dict.keys():
+            dict[level].next = node
+            dict[level] = node
+        else:
+            dict[level] = node
+