Create 102-Binary-Tree-Level-Order-Traversal.py

Author: neetcode-gh

102-Binary-Tree-Level-Order-Traversal.py

@@ -0,0 +1,23 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def levelOrder(self, root: TreeNode) -> List[List[int]]:
+        res = []
+        q = collections.deque()
+        if root: q.append(root)
+            
+        while q:
+            val = []
+            
+            for i in range(len(q)):
+                node = q.popleft()
+                val.append(node.val)
+                if node.left: q.append(node.left)
+                if node.right: q.append(node.right)
+            res.append(val)
+        return res