leetcode

0 class Solution {

1 public:

2 int maxLevelSum(TreeNode *root) {

3 queue<TreeNode *> q;

4 q.push(root);

5

6 int maxi = INT_MIN, index = -1;

7 for (int lvl = 1; !q.empty(); lvl++) {

8 int sum = 0;

9 for (int k = q.size(); k > 0; k--) {

10 TreeNode *root = q.front();

11 q.pop();

12 sum += root->val;

13 if (root->left) q.push(root->left);

14 if (root->right) q.push(root->right);

15 }

16 if (sum > maxi) {

17 maxi = sum;

18 index = lvl;

19 }

20 }

21 return index;

22 }

23 };