C++: 9 lines of code
int findBottomLeftValue(TreeNode root) {\n\n\t\tqueue q;\n        q.push(root);\n        TreeNode curr;\n        while(!q.empty()){\n            curr = q.front(
int findBottomLeftValue(TreeNode* root) {\n\n\t\tqueue<TreeNode*> q;\n        q.push(root);\n        TreeNode* curr;\n        while(!q.empty()){\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    }
[]