Leetcode: 1315. Sum of Nodes with Even-Valued Grandparent

题目：

思路：

呃，我知道要用DFS，但乍看题目看不懂什麽是even-value的意思，所以只好看Hint跟Discussion
　
　
　

重新翻译题目

二元树中，如果现在节点的上上层节点的值是偶数，就把现在节点的值sum起来
　
　

程序码

class Solution {
public:
    int sumEvenGrandparent(TreeNode* root) {
        return sum(root, NULL, NULL); // root没父没祖母
    }
private:
    int sum(TreeNode* curr_node, TreeNode* parent, TreeNode* grandParent) {
        if (curr_node == NULL) {
            return 0;
        }
        int addition = 0;
        if (grandParent != NULL) 
            addition = curr_node->val;
        
        TreeNode* Im_even_node= NULL;
        if (curr_node->val % 2 == 0)
            Im_even_node = curr_node;

        return addition + sum(curr_node->left, Im_even_node, parent) + sum(curr_node->right, Im_even_node, parent);
    }

};

参考：
https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/discuss/477095/Easy-DFS-solution