Time: 37 ms (84.20%) | Memory: 18.3 MB (52.22%) - LeetSync

Author: audemed44

513-find-bottom-left-tree-value/find-bottom-left-tree-value.py

@@ -0,0 +1,22 @@
+# 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:
+
+        q = deque()
+        current = root
+        q.append(current)
+
+        while q:
+            current = q.popleft()
+            if current.right:
+                q.append(current.right)
+            if current.left:
+                q.append(current.left)
+        
+        return current.val
+