-
Notifications
You must be signed in to change notification settings - Fork 31
/
1315.java
52 lines (45 loc) · 1.27 KB
/
1315.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private int sum = 0;
private void InorderTraversal(TreeNode root){
if(root == null){
return;
}
InorderTraversal(root.left);
if(root.val%2 == 0 && root.right != null){
if(root.right.right != null){
sum += root.right.right.val;
}
if(root.right.left != null){
sum += root.right.left.val;
}
}
if(root.val%2 == 0 && root.left != null){
if(root.left.right != null){
sum += root.left.right.val;
}
if(root.left.left != null){
sum += root.left.left.val;
}
}
InorderTraversal(root.right);
}
public int sumEvenGrandparent(TreeNode root) {
InorderTraversal(root);
return sum;
}
}