Runtime: 8 ms, faster than 98.36% of C++, very easy and clean code using BFS
```\nint findBottomLeftValue(TreeNode* root) {\n        //vectorv;\n        if(!root)\n            return NULL;\n        queueq;\n        q.push(root);\n     in
```\nint findBottomLeftValue(TreeNode* root) {\n        //vector<int>v;\n        if(!root)\n            return NULL;\n        queue<TreeNode*>q;\n        q.push(root);\n     int ans;\n        while(!q.empty())\n        {\n            int n=q.size();\n            for(int i=1;i<=n;i++)\n            {\n              TreeNode * temp=q.front();\n                q.pop();\n                if(i==1)\n                    ans=temp->val;\n                if(temp->left)\n                    q.push(temp->left);\n                if(temp->right)\n                    q.push(temp->right);\n                \n            }\n        }\n        return ans;\n        \n    }
[]