Python | Easy
see the Successfully Accepted Submission\npython\nclass Solution(object):\n    def findBottomLeftValue(self, root):\n        if not root:\n            return No
[see the Successfully Accepted Submission](https://leetcode.com/submissions/detail/1188465995/)\n```python\nclass Solution(object):\n    def findBottomLeftValue(self, root):\n        if not root:\n            return None\n        \n        queue = deque([root])\n        leftmost_val = None\n        \n        while queue:\n            level_size = len(queue)\n            for i in range(level_size):\n                node = queue.popleft()\n                if i == 0:  # First node of the level, update leftmost value\n                    leftmost_val = node.val\n                if node.left:\n                    queue.append(node.left)\n                if node.right:\n                    queue.append(node.right)\n        \n        return leftmost_val\n```\n![image](https://assets.leetcode.com/users/images/b1e4af48-4da1-486c-bc97-b11ae02febd0_1696186577.992237.jpeg)
['Python']