-
Notifications
You must be signed in to change notification settings - Fork 0
/
DecTreeNode.java
29 lines (27 loc) · 851 Bytes
/
DecTreeNode.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
/**
* Possible class for internal organization of a decision tree. Included to show standardized output
* method, print().
*
* Do not modify. If you use, create child class DecTreeNodeImpl that inherits the methods.
*
*/
public class DecTreeNode {
//If leaf, label to return.
int classLabel;
//Attribute split label.
String attribute;
//Threshold that attributes are split on.
public double threshold;
//Left child. Can directly access and update. <= threshold.
public DecTreeNode left = null;
//Right child. Can directly access and update. > threshold.
public DecTreeNode right = null;
DecTreeNode(int classLabel, String attribute, double threshold) {
this.classLabel = classLabel;
this.attribute = attribute;
this.threshold = threshold;
}
public boolean isLeaf(){
return this.left == null && this.right == null;
}
}