C++ BFS Solution || Runtime 0ms, beats 100.00%
\nclass Solution {\npublic:\n    int findBottomLeftValue(TreeNode* root) {\n\t\tint ans;\n        queue<TreeNode*>q;\n        q.push(root);\n        while(!q.em
```\nclass Solution {\npublic:\n    int findBottomLeftValue(TreeNode* root) {\n\t\tint ans;\n        queue<TreeNode*>q;\n        q.push(root);\n        while(!q.empty()){\n            ans=q.front()->val;\n            int n=q.size();\n            while(n--){\n                TreeNode* node=q.front();\n                q.pop();\n                if(node->left)q.push(node->left);\n                if(node->right)q.push(node->right);\n            }\n        }\n        return ans;\n    }\n};\n```
['Breadth-First Search', 'C']