python3 beats 100% BFS
\nclass Solution:\n    def findBottomLeftValue(self, root: \'TreeNode\') -> \'int\':\n        queue = [root]\n        while queue:\n            node = queue.pop
```\nclass Solution:\n    def findBottomLeftValue(self, root: \'TreeNode\') -> \'int\':\n        queue = [root]\n        while queue:\n            node = queue.pop(0)\n            res = node.val\n            if node.right:\n                queue.append(node.right)\n            if node.left:\n                queue.append(node.left)\n        return res\n```
[]