I've been working on this for a few days, and I can't seem to figure out how to print out the in order traversal of an m-way tree. Can anyone give me some idea on how to do this? I'm really frustrated with it.
I know for a binary tree it would look something like this:
void InOrderPrint(mwayNode *T)
{
if(T)
{
InOrderPrint (T->left);
InOrderPrint (T->right);
cout << T;
}
}

Would an m-way look anything like it?