-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDecisionTree.java
More file actions
250 lines (146 loc) · 4.27 KB
/
DecisionTree.java
File metadata and controls
250 lines (146 loc) · 4.27 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
import java.io.*;
import java.util.*;
import java.math.*;
/*-----------------------------*/
/* */
/* FIELDS */
/* */
/*-----------------------------*/
/* NESTED CLASS */
public class DecisionTree {
public class BinTree {
public int nodeID;
public String skill = null;
public BinTree yesBranch = null;
public BinTree noBranch = null;
/* CONSTRUCTOR */
public BinTree(int newNodeID, String newSkill) {
nodeID = newNodeID;
skill = newSkill;
}
}
/* OTHER FIELDS */
BinTree rootNode = null;
/*----------------------*/
/* */
/* CONSTRUCTORS */
/* */
/*----------------------*/
/* Default Constructor */
public DecisionTree() {
}
/*----------------------*/
/* */
/*TREE BUILDING METHODS */
/* */
/*----------------------*/
/* CREATE ROOT NODE */
public void createRoot(int newNodeID, String newSkill) {
rootNode = new BinTree(newNodeID, newSkill);
}
/* ADD YES NODE */
public void addYesNode(int existingNodeID, int newNodeID, String newSkill) {
// If no root, do nothing
if (rootNode == null) {
return;
}
// Search tree
searchTreeAndAddYesNode(rootNode, existingNodeID, newNodeID, newSkill);
}
/* SEARCH TREE AND ADD YES NODE */
private boolean searchTreeAndAddYesNode(BinTree currentNode, int existingNodeID, int newNodeID, String newSkill) {
if (currentNode.nodeID == existingNodeID) {
// Found node
if (currentNode.yesBranch == null) {
currentNode.yesBranch = new BinTree(newNodeID, newSkill);
} else {
currentNode.yesBranch = new BinTree(newNodeID, newSkill);
}
return(true);
} else {
// Try yes branch if it exists
if (currentNode.yesBranch != null) {
return(searchTreeAndAddYesNode(currentNode.noBranch, existingNodeID, newNodeID, newSkill));
} else {
// Try no branch if it exists
if (currentNode.noBranch != null) {
return(searchTreeAndAddYesNode(currentNode.noBranch, existingNodeID, newNodeID, newSkill));
} else {
return(false); // Not found here
}
}
// Not found here
}
}
/* ADD NO NODE */
public void addNoNode(int existingNodeID, int newNodeID, String newSkill) {
// If no root node, do nothing
if (rootNode == null) {
return;
}
// Search tree
searchTreeAndAddNoNode(rootNode, existingNodeID, newNodeID, newSkill);
}
/* SEARCH TREE AND ADD NO NODE */
private boolean searchTreeAndAddNoNode(BinTree currentNode, int existingNodeID, int newNodeID, String newSkill) {
if (currentNode.nodeID == existingNodeID) {
// Found node
if (currentNode.noBranch == null) {
currentNode.noBranch = new BinTree(newNodeID, newSkill);
} else {
currentNode.noBranch = new BinTree(newNodeID, newSkill);
}
return(true);
} else {
// Try yes branch if it exists
if (currentNode.yesBranch != null) {
if (searchTreeAndAddNoNode(currentNode.yesBranch, existingNodeID, newNodeID, newSkill)) {
return(true);
} else {
// Try no branch if it exists
if (currentNode.noBranch != null) {
return(searchTreeAndAddNoNode(currentNode.noBranch, existingNodeID, newNodeID, newSkill));
} else {
return(false); // Not found here
}
}
} else {
return(false); // Not found here
}
}
}
/*-----------------------------------------------*/
/* */
/* TREE QUERY METHODS */
/* */
/*-----------------------------------------------*/
public static DecisionTree newTree = new DecisionTree();
public int queryBinTree(String word, HashMap<Integer, String> map, int n_nodes) throws IOException {
int n=0;
if (rootNode.skill.equalsIgnoreCase(word) == true) {
return 1;
}
n++;
BinTree currentNode, currentNode1;
for (int i=n; i<=(n_nodes/2); i++) {
newTree.createRoot(1, map.get(i));
for (int j=(i*2); j<= (i*2)+1; j++) {
if (j%2==0) {
newTree.addYesNode(i,j, map.get(j-1));
}
else {
newTree.addNoNode(i,j, map.get(j-1));
}
}
currentNode = rootNode.yesBranch;
currentNode1 = rootNode.noBranch;
if (currentNode.skill.equalsIgnoreCase(word) == true) {
return 1;
}
else if (currentNode1.skill.equalsIgnoreCase(word) == true) {
return 1;
}
}
return 0;
}
}