-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
79 lines (73 loc) · 2.25 KB
/
Main.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package com.company;
import java.util.ArrayDeque;
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;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
public boolean isCousins_bfs(TreeNode root, int x, int y) {
int parent = 0, depth = 0, level = 0;
ArrayDeque<TreeNode> queue = new ArrayDeque<>(){{offer(root);}};
while (!queue.isEmpty()){
int count = queue.size();
level++;
for (int i = 0; i < count; i++) {
TreeNode cur = queue.poll();
if(cur.left != null){
queue.offer(cur.left);
if(cur.left.val == x){
parent += cur.val;
depth += level;
}
else if(cur.left.val == y){
parent -= cur.val;
depth -= level;
}
}
if(cur.right != null){
queue.offer(cur.right);
if(cur.right.val == x){
parent += cur.val;
depth += level;
}
else if(cur.right.val == y){
parent -= cur.val;
depth -= level;
}
}
}
}
return parent != 0 && depth == 0;
}
TreeNode xParent;
TreeNode yParent;
int depth = 0;
public boolean isCousins_dfs(TreeNode root, int x, int y) {
dfs(root, null, x, y, 0);
return xParent != yParent && depth == 0;
}
public void dfs(TreeNode node, TreeNode parent, int x, int y, int level){
if(node == null) return;
if(node.val == x){
xParent = parent;
depth += level;
}
if(node.val == y){
yParent = parent;
depth -= level;
}
dfs(node.left, node, x, y, level + 1);
dfs(node.right, node, x, y, level + 1);
}
}