Python beats 90% DFS
\nclass Solution:\n    def findBottomLeftValue(self, root: TreeNode) -> int:\n        \n        res = [root.val, 0]\n        self.search(root, res, 0)\n        
```\nclass Solution:\n    def findBottomLeftValue(self, root: TreeNode) -> int:\n        \n        res = [root.val, 0]\n        self.search(root, res, 0)\n        return res[0]\n    \n    def search(self, node, res, curDepth):\n        \n        if node:\n            if curDepth > res[1]:\n                res[0], res[1] = node.val, curDepth\n            \n            self.search(node.left, res, curDepth+1)\n            self.search(node.right, res, curDepth+1)\n            \n```
['Depth-First Search', 'Python']