leetcode每日一题第九十三天

class Solution {
public:
    bool isLeafnode(TreeNode* node)
    {
        return !node->left && !node->right;
    }
    int dfs(TreeNode* node)
    {
        int sum = 0;
        if(node->left)
        {
            sum += isLeafnode(node->left) ? node->left->val : dfs(node->left);
        }
        if(node->right && !isLeafnode(node->right))
        {
            sum += dfs(node->right);
        }
        return sum;
    }
    int sumOfLeftLeaves(TreeNode* root) {
        return root ? dfs(root) : 0;
    }
};