1302. Deepest Leaves Sum

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
 * 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) {
        // BFS
        int ret = 0;
        if(!root) return 0;
        queue<TreeNode*> q({root});
        while(!q.empty()){
            int size = q.size();
            int temp =0;
            for(int i=0;i<size;++i){
                TreeNode *p = q.front(); q.pop();
                temp+=p->val;
                if(p->left) q.push(p->left);
                if(p->right) q.push(p->right);
            }
            ret = temp;
        }
        return ret;
    }
};

analysis

  • time complecity O(n), n is the number of node
  • space complecity O(n)