LeetCode 404. 左叶子之和（C++、python）

计算给定二叉树的所有左叶子之和。

示例：

    3
   / \
  9  20
    /  \
   15   7

在这个二叉树中，有两个左叶子，分别是 9 和 15，所以返回 24

C++

/**
 * 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:
    void func(TreeNode* node, int* k, int f1, int f2)
    {
        if(f1)
        {
            if(node!=NULL)
            {
                if(NULL==node->left && NULL==node->right)
                {
                    (*k)+=node->val;                    
                }
                func(node->left,k,1,0);
                func(node->right,k,0,1);   
            }           
        }
        else
        {
            if(node!=NULL)
            {
                func(node->left,k,1,0);
                func(node->right,k,0,1);                
            }
        }
    }
    
    int sumOfLeftLeaves(TreeNode* root) 
    {
        int res=0;
        int* k=&res;
        if(root!=NULL)
        {
            func(root->left,k,1,0);
            func(root->right,k,0,1);           
        }
        return res;
    }
};

python

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def func(self, node, res, f1, f2):
        if f1:
            if node:
                if None==node.left and None==node.right:
                    res+=node.val
                res=self.func(node.left,res,1,0)
                res=self.func(node.right,res,0,1)
        else:
            if node:                
                res=self.func(node.left,res,1,0)
                res=self.func(node.right,res,0,1)  
        return res
            
    def sumOfLeftLeaves(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        res=0
        if root:
            res=self.func(root.left,res,1,0)
            res=self.func(root.right,res,0,1)
        return res