先序遍历的非递归算法

#include <iostream>

using namespace std;
#define OK 1
#define ERROR 0
typedef int Status;
typedef int sElemType;

typedef struct BiTNode{
     sElemType data;
     struct BiTNode *lchild,*rchild;

}BiTNode,*BiTree;

void CreatBiTree(BiTree &T)
{
    int N;
  cin>>N;
  if(N==0) T=NULL;
  else
    {
    T=new BiTNode;
    T->data=N;
    CreatBiTree(T->lchild);
    CreatBiTree(T->rchild);
    }

}


typedef struct StackNode{
  BiTree data;
  struct StackNode *next;
}StackNode,*LinkStack;

Status InitStack(LinkStack &s){
s=NULL;
return OK;
}

Status Push(LinkStack &s,BiTree e)
{
    LinkStack p;
    p=new StackNode;
    p->data=e;
    p->next=s;
    s=p;
    return OK;

}
Status Pop(LinkStack &s,BiTree &e)
{
    LinkStack p;
    if(s==NULL)
        return ERROR;
    e=s->data;
    p=s;
    s=s->next;
    delete p;
    return OK;
}
Status StackEmpty( LinkStack &s)
{
    if(s==NULL)
        return OK;
    else
        return ERROR;

}

void PreOrderTraverse(BiTree T)
{
    LinkStack s;
    BiTree q;
    BiTree p;
    InitStack(s);
    p=T;
    q=new BiTNode;
    while(p||!StackEmpty(s))
    {

        if(p)
        {
            Push(s,p);
            p=p->lchild;
        }
        else
        {
            Pop(s,q);
            cout<<q->data;
            p=q->rchild;

        }
    }
}

int main()
{
    int N;
    BiTree T;
    T=NULL;
    cin>>N;
    CreatBiTree(T);
    PreOrderTraverse(T);
    return 0;

}