5 Line code || C++ || DFS
\nclass Solution {\npublic:\n    void solve(TreeNode* root,int &ans,int& m,int h){\n        if(root==NULL)return;\n        if(h>m){\n            m = h;\n       
```\nclass Solution {\npublic:\n    void solve(TreeNode* root,int &ans,int& m,int h){\n        if(root==NULL)return;\n        if(h>m){\n            m = h;\n            ans = root->val;\n        }\n        solve(root->left,ans,m,h+1);\n        solve(root->right,ans,m,h+1);\n    }\n    int findBottomLeftValue(TreeNode* root) {\n        int ans,m = -1;\n        solve(root,ans,m,0);\n        return ans;\n    }\n};\n```
['Depth-First Search', 'Recursion', 'C', 'C++']