//----------------------------------------------------------------------------- //----Preorder traversal template void tree::PreorderTaverse(void) { DoPreorderTaverse(Root); cout << endl; } //----------------------------------------------------------------------------- //----Workhorse for PreorderTraverse template void tree::DoPreorderTaverse(treenode *Node) { int Index; if (Node != NULL) { cout << Node->Data << " "; for (Index = 0; Index < Degree; Index++) DoPreorderTaverse(Node->Offspring[Index]); } } //-----------------------------------------------------------------------------