Submitted Solution for 0513 in python

Author: prranavv

Diff for: python/0513-find-bottom-left-tree-value.py

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