Chuk

//队列和栈 void InvertLevel(BiTree bt) { Stack s; Queue Q; if (bt != NULL) { InitStack(s); InitQueue(Q); EnQueue(Q, bt); while (!IsEmpty(Q)) { DeQueue(Q, p); push(s, p);

//利用栈 void PostOrder(BiTree T) { InitStack(S); P = T; r = NULL; while (p || IsEmpty(S)) { if (p) { push(S, p); p = p->lchild; } else { GetTop(S, p);