/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
void postorder(struct TreeNode* root,int* sum,int tag){
if(!root) return;
postorder(root->left,sum,1);
postorder(root->right,sum,0);
if(tag==1 && !root->left&&!root->right) *sum+=root->val;
}
int sumOfLeftLeaves(struct TreeNode* root){
if(!root) return 0;
int sum=0;
postorder(root,&sum,3);
return sum;
}
结果;
标签:TreeNode,struct,int,sum,叶子,404,root,postorder From: https://www.cnblogs.com/llllmz/p/18055032