算法设计-后序（根）遍历二叉树

》利用栈实现

Status PostOrderTraverse(BiTree T,Status(*Visit)(TElemType e)){ //后序遍历二叉链表，每个元素调用Visit

           InitStack(S);P=T;

           while (p||StackEmpty(S)){

                   if(p){

                        Push(S,p)              //根节点入栈

                        p=p->lchild;        //遍历左子树

                   }//if

                   else{

                        Pop(S,p);              //根节点出栈，访问兄弟结点

                        p=p->father->rchild; 

                        visit(p->data);      

                   }//else

》递归实现

void PostOrder(BiTree T){

     if(T){

           PostOrder(T->lchild);   //遍历左子树

           PostOrder(T->rchild);   //遍历右子树

           printf("%c",T->data);  //访问结点

    }//if

}//PostOrder