决策树构造算法的实现课程设计报告

f(T->data=="Temperature")Р {Р for (tree p=T->firstchild; p!=NULL; p=p->nextsibling)Р if(undec[1]==p->weight) decision(p);Р }Р else if(T->data=="Humidity")Р {Р for (tree p=T->firstchild; p!=NULL; p=p->nextsibling)Р if(undec[2]==p->weight) decision(p);Р }Р else if(T->data=="Wind")Р {Р for (tree p=T->firstchild; p!=NULL; p=p->nextsibling)Р if(undec[3]==p->weight) decision(p);Р }Р else cout<<T->data<<endl;Р}Р//从文件转移数据到链表中Рvoid input()Р{Р attr_L=new AttrNode;Р attr_L->next=NULL;Р LL=new LNode;Р LL->next=NULL;Р InitLink(); //从训练数据集读取数据到LLР InitAttr();//将属性读取到attr_L中Р}Р//以广义表的形式输出树Рvoid treelists(tree T)Р{Р tree p;Р fout<<'{'<<T->weight<<'}';Р fout<<T->data;Р p=T->firstchild;Р if (p!=NULL)Р {Р fout<<'(';Р while (p!=NULL)Р {Р treelists(p);Р p=p->nextsibling;Р if (p!=NULL) fout<<',';Р }Р fout<<')';