题解方法一:
/**
* 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 result=0;
if(root==nullptr) return result;
Select(root,result);
return result;
}
void Select(TreeNode* root,int &result){
// 满足下面条件为左子叶
if(root->left!=nullptr&&root->left->left==nullptr&&root->left->right==nullptr){
result+=root->left->val;
}
if(root->left!=nullptr){
Select(root->left,result);
}
if(root->right!=nullptr){
Select(root->right,result);
}
}
};
题解方法二:
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root) {
int result=0;
Select(root,result,false);
return result;
}
// IsLeftnode表示当前节点是否为左节点
void Select(TreeNode* root,int &result,bool IsLeftnode){
if(root==nullptr) return;
if(root->left==nullptr && root->right==nullptr && IsLeftnode){
result+=root->val;
}
if(root->left!=nullptr){
Select(root->left,result,true);
}
if(root->right!=nullptr){
Select(root->right,result,false);
}
}
};