_1315. Sum of Nodes with Even-Valued Grandparent.md

1315. Sum of Nodes with Even-Valued Grandparent

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 12, 2024

Last updated : July 01, 2024

---

Related Topics : Tree, Depth-First Search, Breadth-First Search, Binary Tree

Acceptance Rate : 85.64 %

---

Solutions

• m1315.py

Python

m1315.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def sumEvenGrandparent(self, root: TreeNode) -> int:
        check = []      # (node, parent val, grandparent val)
        outputSum = 0

        if root.left :
            check.append((root.left.left, root.left.val, root.val))
            check.append((root.left.right, root.left.val, root.val))

        if root.right :
            check.append((root.right.right, root.right.val, root.val))
            check.append((root.right.left, root.right.val, root.val))

        while check :
            curr, parentVal, grandParentVal = check.pop()
            if not curr :
                continue
            
            if grandParentVal % 2 == 0 :
                outputSum += curr.val
            
            check.append((curr.left, curr.val, parentVal))
            check.append((curr.right, curr.val, parentVal))

        return outputSum