C++ BFS Solution || Easy with Explanation !
Upvote If You Like and find it Helpful !\n\nclass Solution {\npublic:  \n int findBottomLeftValue(TreeNode* root) {\n     queue<TreeNode*>q; int ans=0;\n     q.
***Upvote If You Like and find it Helpful !***\n```\nclass Solution {\npublic:  \n int findBottomLeftValue(TreeNode* root) {\n     queue<TreeNode*>q; int ans=0;\n     q.push(root);\n     while(!q.empty())\n     {\n  // the logic here is as we will do level order traversal(BFS) and only we want the very first node of that level!\n         int size = q.size();\n         for(int i=1; i<=size ;i++)\n         {\n         TreeNode *front = q.front(); q.pop();\n            if(i==1) // So here we are printing only very first node of that level which is our left view node of given binary tree.\n            ans = front->val;\n         if(front->left) q.push(front->left);\n         if(front->right) q.push(front->right);\n         }\n     }\n     return ans;\n    }\n};\n```
['Queue', 'C']