void PSBinaryTree::PostOrder(Object *obj) { BiTreeNode *t = (BiTreeNode *)obj,*p;

LinStack<BiTreeNode *> S;

int tag[255] , top=-1; p = t;

while(p != NULL|| !S.IsEmpty()) { while(p != NULL) { S.Push(p);

tag[++top] = 0; p = p->leftchild(); }

if(top > -1) if(tag[top] == 1) { cout << S.GetTop()->Getdata()<<'\t';

S.Pop();

top--; }

else{

p = S.GetTop(); tag[top] = 1;

p = p->rightchild(); } } }