💢💢💢LOT -->Level Order Traversal 💥💥💥
\n# Code\n\n\nclass Solution {\n    public int maxLevelSum(TreeNode root) {\n        Queue<TreeNode> que = new LinkedList<>();\n        int level=0,max=Integer.
\n# Code\n```\n\nclass Solution {\n    public int maxLevelSum(TreeNode root) {\n        Queue<TreeNode> que = new LinkedList<>();\n        int level=0,max=Integer.MIN_VALUE,cnt=0;\n        que.add(root);\n        while(!que.isEmpty()){\n            cnt++;\n            int sum=0;\n            int n=que.size();\n            for(;n>0;n--){\n                TreeNode cur=que.remove();\n                sum+=cur.val;\n                if(cur.left!=null)que.add(cur.left);\n                if(cur.right!=null)que.add(cur.right);\n            }\n\n            if(sum>max){\n                max=sum;\n                level=cnt;\n            }\n        }\n        return level;\n    }\n}\n```
['Java']