404. Sum of Left Leaves

Find the sum of all left leaves in a given binary tree.

Example:

    3
   / \
  9  20
    /  \
   15   7

There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

还是概念，左叶子节点，对于一个结点，其左子树不为空，且其左子树的左子节点和右子节点都为空，则其为左叶子节点。

/**
 * 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 sumOfLeftLeaves(TreeNode* root) {
        int rs = 0;
        sum(root, rs);
        return rs;
    }
    
    void sum(TreeNode* root, int& val){
        if(!root){
            return;
        }    

        if(root->left && !root->left->left && !root->left->right){
            val += root->left->val;
        }
        sum(root->left, val);
        sum(root->right, val);
    }
    
};