Bottom left tree value
Please upvote if you found it helpful\n\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeN
***Please upvote if you found it helpful***\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        queue<TreeNode*> q;\n        q.push(root);\n        \n        while(!q.empty()){\n           root=q.front();\n            q.pop();\n            if(root->right) q.push(root->right);\n            if(root->left) q.push(root->left);\n            \n        }\n        return root->val;\n    }\n};\n\n```\n***Please upvote if you found it helpful***
['C', 'C++']