Create Binary_Tree_Level_Order_Traversal.py

Author: Ram-95

Leetcode_30day_challenge/Binary_Tree_Level_Order_Traversal.py

@@ -0,0 +1,27 @@
+class Solution:
+    def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
+        if not root:
+            return None
+        q = [root]
+        sep = '$'
+        ans = []
+        q.append(sep)
+        res = []
+        prev = -1
+        while q:
+            temp = q.pop(0)
+            if prev == temp:
+                break
+            if temp != sep:
+                res.append(temp.val)
+                if temp.left:
+                    q.append(temp.left)
+                if temp.right:
+                    q.append(temp.right)
+            else:
+                ans.append(list(res))
+                res = []
+                q.append(sep)
+            prev = temp
+                
+        return ans