void inordertraverse(bitree t)
{
initstack(s); p = t;
q = new bitnode;
while (p || !stackempty(s))
{
if (p)
{
push(s, p);
p = p->lchild;
}
else
{
pop(s, q);
cout << q->data;
p = q->rchild;
}
}
}
void inordertraverse(bitree t)
{
initstack(s); p = t;
q = new bitnode;
while (p || !stackempty(s))
{
if (p)
{
push(s, p);
p = p->lchild;
}
else
{
pop(s, q);
cout << q->data;
p = q->rchild;
}
}
}