题目描述:
计算给定二叉树的所有左叶子之和。(求的是左叶子结点之和)
示例:
代码如下:
/**
* 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) {
vector<int>v;
dfs(root,v);
return accumulate(v.begin(),v.end(),0);
}
void dfs(TreeNode* root,vector<int>&v)
{
if(root==NULL){
return;
}
if(root->left!=NULL&&root->left->left==NULL&&root->left->right==NULL)
{
v.push_back(root->left->val);
}
dfs(root->left,v);
dfs(root->right,v);
}
};
执行结果: