-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNode.java
56 lines (43 loc) · 937 Bytes
/
Node.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
import java.util.ArrayList;
public class Node {
private int info;
private Node parent;
private ArrayList<Node> children = new ArrayList<Node>();
public Node(int in, Node prnt){
info = in;
parent = prnt;
}
public Node(int in, ArrayList<Node> chldrn){
info = in;
children = chldrn;
}
public Node(int in) {
info = in;
}
public int GetInfo() {
return info;
}
public void AddChild(Node child) {
children.add(child);
}
public ArrayList<Node> getChildren(){
return children;
}
public Node getParent() {
return parent;
}
public void UpdateInfo(int score, int team) {
info = score;
if(hasParent() && team == 1 && score>parent.GetInfo()) {
parent.UpdateInfo(score , (team+1)%2);
}
if(hasParent() && team == 0 && score<parent.GetInfo()) {
parent.UpdateInfo(score , (team+1)%2);
}
}
public boolean hasParent() {
if(parent != null)
return true;
return false;
}
}