// because these node sorted descendingly according to gini gain or information gain.
// (namely, gini gain or information gain of all nodes in BestFirstEelements is 0).
if (gain==0) {
for (int i=0; i<BestFirstElements.size(); i++) {
FastVector element = (FastVector)BestFirstElements.elementAt(i);
BFTree node = (BFTree)element.elementAt(0);
node.makeLeaf(train);
}
BestFirstElements.removeAllElements();
return false;
}