Status SqlLaterBiTree(LinkStack &S, BiTree T)
{
BiTNode *p = T;
BiTNode *q = new BiTNode;
BiTNode *e = new BiTNode;
int flag = 0;
while (p || !Empty(S))
{
while (p) {
PushStack(S, p);
p = p->lchild;
}
flag = 1;
p = NULL;
while (flag ==1)
{
e = Gettop(S);
if (e->rchild == p) {
PopStack(S, q); p = q;
cout << p->data << "\t";
}
else
{
p = e->rchild;
flag = 0;
}
}
}
return OK;
}

这段二叉树后序非递归遍历出现了错误,请问怎么改
- 写回答
- 好问题 0 提建议
- 关注问题
- 邀请回答
-