Very Very Easy 8 line code C++
\n int findBottomLeftValue(TreeNode *root)\n        {\n            queue<TreeNode*> q;\n            q.push(root);\n            TreeNode * curr;\n            whi
```\n int findBottomLeftValue(TreeNode *root)\n        {\n            queue<TreeNode*> q;\n            q.push(root);\n            TreeNode * curr;\n            while (!q.empty())\n            {\n                curr = q.front();\n                q.pop();\n                if (curr->right != NULL) q.push(curr->right);\n                if (curr->left != NULL) q.push(curr->left);\n            }\n            return curr->val;\n        }\n```
[]