void KTREE::preorder_traversal()
{
TNode *tmp; //pre order
tmp=top;
if (top==0)
cout <<"empty tree !!!"<<endl;
else
{
cout <<tmp->getElement()<<" ";
for (int i=0;i<MAX;i++)
if (top->getChild(i)!=0)
preorder_traversal(top->getChild(i));
}
cout<<endl;
}
void KTREE::postorder_traversal()
{ //postorder
TNode *tmp;
tmp=top;
int i;
if (top==0)
cout <<"empty tree !!!"<<endl;
else
{
for (i=0;i<MAX;i++)
{
if (top->getChild(i)!=0)
postorder_traversal(top->getChild(i));
}
cout <<" "<<top->getElement();
}
cout<<endl;
}
