Practice-Leetcode/SumLeftLeafNodes.cpp at master · adilhamid/Practice-Leetcode · GitHub

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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sumOfLeftLeavesIter(TreeNode* root) {
        if(!root) return 0;
        int res = 0;
        queue<TreeNode*> queue;
        queue.push(root);

        while(!queue.empty()){
            TreeNode* node = queue.front();
            queue.pop();


            if(node->left){
                if( !node->left->left && !node->left->right)
                    res += node->left->val;
                else
                    queue.push(node->left);
            }

            if(node->right){
                if(node->right->left || node->right->right)
                    queue.push(node->right);
            }


        }
             return res;
    }

     int sumOfLeftLeaves(TreeNode* root) {
         if(!root) return 0;
         int ans = 0;
         if(root->left){
             if(!root->left->left && !root->left->right)
                ans += root->left->val;
            else
                ans += sumOfLeftLeaves(root->left);
         }

         if(root->right){
             if(root->right->left || root->right->right)
                ans+=sumOfLeftLeaves(root->right);
         }

        return ans;

     }


};