Sum With Even-Valued Grandparent
You are given the root of a binary tree. Return the sum of the values of all nodes whose grandparent (the parent's parent) exists and has an even value. If there are no such nodes, return 0.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
returns 18
The nodes with an even grandparent (6 or 2 or 8...) are summed to 18.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.