void InOrderTraverse(BiTree T, Status (* visit)(ElemType e))
{
BiTree pStack[100], p;
int top = -1;
if(T != NULL)
{
p = T;
while(top > -1 || p != NULL)
{
while(p != NULL)
{
pStack[++top] = p;
p = p->lchild;
}
if(top > -1)
{
p = pStack[top--];
visit(p->data);
p = p->rchild;
}
}
}
}
第 2 页 / 共 34 页