leetcode 1302层数最深叶子结点之和

class Solution {
public:
    int deepestLeavesSum(TreeNode* root) {
       if(!root)
       {
           return 0;
       }
       
        queue<TreeNode*>que;
        que.push(root);
        int sum;
        while(!que.empty())
        {
            int size=que.size(); 
            sum=0;
           for(int i=0;i<size;i++)
            {
                TreeNode *q=que.front();
            que.pop();
           sum+=q->val;
            if(q->left)
            {
                que.push(q->left);

            }
            if(q->right)
            {
                que.push(q->right);
            }
            }
            
        }
return sum;
    }
};