题目:祖父节点值为偶数的节点和
思路:遍历树的各个结点,如果该结点的值是偶数 那就把这个结点的孙子结点的值统统加起来。 最后返回即可
class Solution {
int sum ;
public int sumEvenGrandparent(TreeNode root) {
getSum(root);
return sum;
}
public void getSum(TreeNode root){
if (root == null)
return;
if (root.val %2 == 0){
if (root.left != null )
{
if (root.left.left !=null ){
sum = sum + root.left.left.val;
}
if (root.left.right !=null ){
sum = sum + root.left.right.val;
}
}
if (root.right != null )
{
if (root.right.left !=null ){
sum = sum + root.right.left.val;
}
if (root.right.right !=null ){
sum = sum + root.right.right.val;
}
}
}
getSum(root.left);
getSum(root.right);
}
}