1302. Deepest Leaves Sum.cpp

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int deepestLeavesSum(TreeNode* root) {
        
        queue<TreeNode*> q;
        q.push(root);
        
        int level_sum = 0;
        
        while(q.size())
        {
            level_sum = 0;
            int size = q.size();
            for(int i=0;i<size;i++)
                
            {
                TreeNode* curr_node = q.front();
                q.pop();
                level_sum += curr_node->val;
                if(curr_node->left) q.push(curr_node->left);
                if(curr_node->right) q.push(curr_node->right);
                
                
                
            }
        }
        return level_sum;
        
    }
};