void Trees::PrintPre(Node * node)
{
if(node == NULL)
{
return;
}
printf("Depth=%d,TBN:%d%d%d,Var:%d,Mu:%0.17f,SplitVal:%0.17f\n",
node->Depth,node->Top,node->Bot,node->Nog,node->Var,node->TrainedMu,node->SplitVal);
PrintPre(node->LeftC);
PrintPre(node->RightC);
}
void Print(SearchTree Tree)//打印出二叉树，中序+先序 唯一确定
{
printf("这个二叉树的中序遍历结果是：\n");
PrintMid(Tree);
printf("\n这个二叉树的先序遍历结果是：\n");
PrintPre(Tree);
printf("\n");
}
void PrintPre(SearchTree T)//先序遍历打印出来
{
if(T==null)
printf("错误，链表为空！");
else
{
if(T->Left!=null)
PrintPre(T->Left);
if(T->Right!=null)
PrintPre(T->Right);
printf(" %d ",T->Element );
}
}
void Trees::PrintTrees()
{
for(unsigned int i = 1; i < theTrees.size(); i++)
{
printf("Tree%u\n",i);
PrintPre(theTrees[i]);
}
}
