Simple Java Solution DFS
\tclass Solution {\n    int ans;\n    public int findBottomLeftValue(TreeNode root) {\n        ans = root.val;\n        height(root, 1);\n        return ans;\n 
\tclass Solution {\n    int ans;\n    public int findBottomLeftValue(TreeNode root) {\n        ans = root.val;\n        height(root, 1);\n        return ans;\n    }\n    \n    int height = 0;\n    public void height(TreeNode node, int depth){\n        if(node == null)\n            return;\n        \n        if(depth > height){\n            height = depth;\n            ans = node.val;\n        }\n        \n        height(node.left, depth + 1);\n        height(node.right, depth + 1);\n    }\n    \n}\n\n**If you liked solution upvote it**
['Depth-First Search', 'Java']