C++后根遍历二叉树的两种递归算法

 // 存储结构：
 
typedef struct BTnode......{
          char data;
          struct BTnode* lchild;
          struct BTnode* rchild;
          }BTnode,*BTree;
 
//C实现：
 
int postOrd(BTree T)......{
        int top = 0;
        int tags[MAX_TREE_DEGREE];//tag stack
        BTree p = T;
        BTree nodePointer[MAX_TREE_DEGREE];

        while(p || top > 0)......{
            if(p)......{
                nodePointer[top] = p;
                //初始化当前入栈接点指针的初值为0
                tags[top] = 0;
                ++ top;
                p = p->lchild;
            }
            else if( tags[--top] == 0)......{//访问右子树并且设置tag为1
                tags[top] = 1;
                p = nodePointer[top];
                p = p->rchild;
                //下面的自增运算表示是\"copy\"而不是\"pop\"接点指针
                ++ top; [Page]
            }else......{//出栈 No \"++top\"
                p = nodePointer[top];
                print(p);
            }
            return 1;
        }//while
    }