计算给定二叉树的所有左叶子之和。
https://leetcode-cn.com/problems/sum-of-left-leaves/
思路:
好像了然于胸,掌握住那个套路了,不过这才是简单题。
/**
* 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 ans=0;
void dfs(TreeNode *root){
if(root==NULL)
return;
if(root->left && !root->left->left && !root->left->right)
ans+=root->left->val;
dfs(root->left);
dfs(root->right);
}
int sumOfLeftLeaves(TreeNode* root) {
dfs(root);
return ans;
}
};