题目链接:https://leetcode.com/problems/sum-of-left-leaves/#/description
注意:叶子节点:一棵树当中没有子结点(即度为0)的结点,称为叶子结点,简称“叶子”。 叶子是指度为0的结点,又称为终端结点。
/**
* 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) {
if(root==NULL){
return 0;
}
int k=0;
if(root->left&&root->left->left==NULL&&root->left->right==NULL){
k=root->left->val;
}
return k+sumOfLeftLeaves(root->left)+sumOfLeftLeaves(root->right);
}
};