Simple C++ Solution using Level Order Traversal (Left View Of Binary Tree)
\n# Code\n\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(
\n# Code\n```\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode() : val(0), left(nullptr), right(nullptr) {}\n *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n    int findBottomLeftValue(TreeNode* root) {\n          vector<int> ans;\n       queue<TreeNode*> q;\n       q.push(root);\n       if(root == NULL)\n           return 0;\n       while(1)\n       {\n           int size = q.size();\n           if(size == 0)\n               break;\n           int count = 0;\n           while(size > 0)\n           {\n               TreeNode* temp = q.front();\n               q.pop();\n               if(count == 0)\n                   ans.push_back(temp->val);\n\n             if(temp->left!=NULL)\n                   q.push(temp->left);\n               \n             if(temp->right!=NULL)\n                   q.push(temp->right);\n               \n               size--;\n               count++;\n           }\n       }\n       \n       return ans[ans.size()-1]; \n    }\n};\n```
['Tree', 'Binary Tree', 'C++']