1 ms java solution using level order traversal fast 1ms
class Solution {\n    public int findBottomLeftValue(TreeNode root) {\n        Queue q=new LinkedList<>();\n        q.add(root);\n        int result=0;\n       
# class Solution {\n    public int findBottomLeftValue(TreeNode root) {\n        Queue<TreeNode> q=new LinkedList<>();\n        q.add(root);\n        int result=0;\n        while(!q.isEmpty())\n        {\n            int count=q.size();\n            for(int i=0;i<count;i++)\n            {\n                TreeNode curr=q.poll();\n                if(i==0)\n                {\n                    result=curr.val;\n                }\n                if(curr.left!=null)\n                {\n                    q.add(curr.left);\n                }\n                if(curr.right!=null)\n                {\n                    q.add(curr.right);\n                }\n            }\n        }\n        return result; \n    }\n}
['Java']