C++ 98% fast
...\n        \n\t\tint findBottomLeftValue(TreeNode root) {\n        queuequ;\n        if(root==NULL)\n            return 0;\n        qu.push(root);\n        in
...\n        \n\t\tint findBottomLeftValue(TreeNode* root) {\n        queue<TreeNode*>qu;\n        if(root==NULL)\n            return 0;\n        qu.push(root);\n        int ans;\n            while(!qu.empty())\n            {\n                TreeNode *curr=qu.front();\n                ans=qu.back()->val;\n                qu.pop();\n                if(curr->right!=NULL)\n                    qu.push(curr->right);\n                if(curr->left!=NULL)\n                    qu.push(curr->left);\n                \n            }\n        return ans;\n\t\t}\n        \n    \n\t...
[]