C++-100 % EFFICIENT & EASY CODE
\nclass Solution{\npublic:\n    int maxLevelSum(TreeNode* root){\n        int ll=0;\n        queue<TreeNode*> q;\n        q.push(root);\n        int maxi=INT_MI
```\nclass Solution{\npublic:\n    int maxLevelSum(TreeNode* root){\n        int ll=0;\n        queue<TreeNode*> q;\n        q.push(root);\n        int maxi=INT_MIN;\n        int i=1;\n        while(!q.empty()){\n            int sz=q.size();\n            int sum=0;\n            for(int i=0;i<sz;i++){\n                TreeNode* node=q.front();\n                q.pop();\n                sum+=node->val;\n                if(node->left){\n                   q.push(node->left);\n                }\n                if(node->right){\n                    q.push(node->right);\n                }\n            }\n            if(sum > maxi){\n                maxi=sum;\n                ll=i;\n            }\n            i++;\n        }\n        return ll;\n    }\n};\n\n```
['Tree', 'Breadth-First Search', 'Queue', 'C++']