void inordertraversenocur(BST T)
{
stack S;
BST p = T;
BST q = (BST)malloc(sizeof(node));
while (p || !S.empty());
{
if (p)
{
S.push(p);
p = p->lchild;
}
else
{
q = S.top();
S.pop();
printf("%d ",p->num);
p = q->rchild;
}
}
}
阅读(859) | 评论(0) | 转发(0) |