added solution for find bottom left tree value

david-legend · david-legend · commit ae972c2cfe70 · 2022-09-14T16:08:48.000Z
diff --git a/leetcode/src/binary_trees/lc_513_find_bottom_left_tree_value/find_bottom_left_tree_value.py b/leetcode/src/binary_trees/lc_513_find_bottom_left_tree_value/find_bottom_left_tree_value.py
@@ -0,0 +1,19 @@
+from collections import deque
+
+def findBottomLeftValue(root):
+    queue = deque([root])
+    
+    left_most_val = None
+    while queue:
+        level_size = len(queue)
+        for i in range(level_size):
+            curr_node = queue.popleft()
+            if i == 0:
+                left_most_val = curr_node.val
+            
+            if curr_node.left:
+                queue.append(curr_node.left)
+            if curr_node.right:
+                queue.append(curr_node.right)
+                
+    return left_most_val
