题目
代码(首刷看解析)
class Solution {
public:
bool isLeafNode(TreeNode* root) { // 叶子节点
return !root->left && !root->right;
}
int sumOfLeftLeaves(TreeNode* root) {
if(!root)
return 0;
return dfs(root);
}
int dfs(TreeNode* root) {
int res = 0;
if(root->left) {
res += isLeafNode(root->left) ? root->left->val : dfs(root->left);
}
if(root->right) {
res += dfs(root->right);
}
return res;
}
};