思路:
考察二叉树的遍历,遍历每一个节点,判断其是否为左叶子节点,将其值返回。
答案:
/**
* 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 == nullptr) return 0;
if(isLeaf(root->left)) return root->left->val + sumOfLeftLeaves(root->right);
else return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
}
bool isLeaf(TreeNode* node) {
if(node == nullptr) return false;
if(node->left == nullptr && node->right == nullptr) return true;
return false;
}
};