DFS | C++ | Easy
\nclass Solution {\npublic:\n    int bottomleft = 0, lowestlvl = -1;\n    void dfs(TreeNode* s,  int lvl){\n        if(lvl > lowestlvl) {\n            lowestlvl
```\nclass Solution {\npublic:\n    int bottomleft = 0, lowestlvl = -1;\n    void dfs(TreeNode* s,  int lvl){\n        if(lvl > lowestlvl) {\n            lowestlvl = lvl;\n            bottomleft = s->val; \n        }\n        if(s->left) dfs(s->left, lvl+1);\n        if(s->right) dfs(s->right, lvl+1);\n    }\n    int findBottomLeftValue(TreeNode* root) {\n        dfs(root, 0);\n        return bottomleft;\n    }\n};\n```
['Depth-First Search', 'C']