void nInOrder(BinTree t)
{
Stack s;
BinTree c = t;
if(t == NULL) return;
s = CreateEmptyStack();
do{
while(c!=NULL)
{
push(s,c);
c = leftChild(c);
}
c = top(s);
pop(s);
visit(root(c));
c = rightChild(c);
}while(c!=NULL||isEmptyStack(s));
}
{
Stack s;
BinTree c = t;
if(t == NULL) return;
s = CreateEmptyStack();
do{
while(c!=NULL)
{
push(s,c);
c = leftChild(c);
}
c = top(s);
pop(s);
visit(root(c));
c = rightChild(c);
}while(c!=NULL||isEmptyStack(s));
}