Python3 Level Order Solution, faster than 99.5%
python\n# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, x):\n#         self.val = x\n#         self.left = None\n#         sel
```python\n# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, x):\n#         self.val = x\n#         self.left = None\n#         self.right = None\n\nclass Solution:\n    def findBottomLeftValue(self, root: TreeNode) -> int:\n        levels = [root]\n        ans = 0\n        while levels:\n            nxt = []\n            for node in levels:\n                if node.left:\n                    nxt.append(node.left)\n                if node.right:\n                    nxt.append(node.right)\n            if not nxt:\n                ans = levels[0].val\n                break\n            levels = nxt\n        return ans\n```
['Python', 'Python3']