/
DecisionTreeNode.cpp
83 lines (71 loc) · 1.74 KB
/
DecisionTreeNode.cpp
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
80
81
82
83
/*
* Title: Binary Trees
* Author: Isik Ozsoy
* ID: 21703160
* Section: 1
* Assignment: 2
* Description: header file of decisionTree
*/
#include "DecisionTreeNode.h"
#include <iostream>
#include "DecisionTree.h"
using namespace std;
DecisionTreeNode :: DecisionTreeNode() {
usedFeatures = 0;
isLeaf = true;
featureId = -1;
className = -1;
leftChild = 0;
rightChild = 0;
}
DecisionTreeNode :: DecisionTreeNode(bool* usedFeatures, int numFeatures)
{
this->usedFeatures = new bool[numFeatures];
for(int i = 0; i < numFeatures; i++)
this->usedFeatures[i] = usedFeatures[i];
isLeaf = true;
featureId = -1;
className = -1;
leftChild = 0;
rightChild = 0;
}
bool DecisionTreeNode :: getIsLeaf()
{
return isLeaf;
}
int DecisionTreeNode :: getFeatureId()
{
return featureId;
}
int DecisionTreeNode :: getClassName()
{
return className;
}
DecisionTreeNode* DecisionTreeNode :: getRightChild()
{
return rightChild;
}
DecisionTreeNode* DecisionTreeNode :: getLeftChild()
{
return leftChild;
}
bool* DecisionTreeNode :: getUsedFeatures()
{
return usedFeatures;
}
void DecisionTreeNode :: createUsedFeatures(int numFeatures) {
usedFeatures = new bool[numFeatures];
for(int i = 0; i < numFeatures; i++)
usedFeatures[i] = false;
}
void DecisionTreeNode :: setProperties(bool isLeaf, int info, int numFeatures) {
this->isLeaf = isLeaf;
if(isLeaf)
className = info;
else {
featureId = info;
usedFeatures[featureId] = true;
leftChild = new DecisionTreeNode(usedFeatures, numFeatures);
rightChild = new DecisionTreeNode(usedFeatures, numFeatures);
}
}