递归求解,C++实现如下:
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root)
{
if(root == NULL)
return 0;
if(root->left != NULL && root->left->left == NULL && root->left->right == NULL)
return root->left->val + sumOfLeftLeaves(root->right);
return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
}
};