/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root) {
if(root==NULL)return 0;
if(root->left!=NULL&&root->left->left==NULL&&root->left->right==NULL)return root->left->val+sumOfLeftLeaves(root->right);
int l=sumOfLeftLeaves(root->left);
return l+sumOfLeftLeaves(root->right);
}
};
404. 左叶子之和
最新推荐文章于 2024-07-10 11:04:17 发布