二cha树

void porder(BTree *b)
{
    BTree *St[MaxSize],*p;
    int top=1;
    if(b!=NULL)
    {
        top++;
        St[top]=b;
        while(top>-1)
        {
            p=St[top];
            top--;
            printf("%c",p->data);
            if(p->rchild!=NULL)
            {
                top++;
                St[top]=p->rchild;
            }
            if(p->lchild!=NULL)
            {
                top++;
                St[top]=p->lchild;
            }
        }
    }
}

void psorder(BTree*t)
{
    BTree *St[MaxSize];
    BTree*p;
    int flag,top=-1;
    do
    {
        while(t)
        {
            top++;
            St[top]=t;
            t=t->lchild;
        }
        p=NULL;
        flag=1;
        while(top!=-1&&flag)
        {
            t=St[top];
            if(t->rchild==p)
            {
                printf("%c ",t->data);
                top--;
                p=t;
            }
            else
            {
                t=t->rchild;
                flag=0;
            }
        }
    }while(top!=-1)
}

int level(BTree *b,ElemType x,int h)
{
    int h1;
    if(b==NULL)
        return(0);
    else
        if(b->data==x)
            return(h);
        else
        {
            h1=level(b->lchild,x,h+1);
            if(h1!=0)
                return(h1);
            else
                return level(b->rchild,x,h+1);
        }
}

void translevel(BTree *b)
{
    struct node
    {
        BTree *vec[MaxSize];
        int f,r;
    }Qu;
    Qu.f=0;
    Qu.r=0;
    if(b!=NULL)
        printf("%c ",b->data);
    Qu.vec[Qu.r]=b;
    Qu.r=Qu.r+1;
    while(Qu.f<Qu.r)
    {
        b=Qu.vec[Qu.f];
        Qu.f=Qu.f+1;
        if(b->lchild!=NULL)
        {
            printf("%c",b->lchild->data);
            Qu.vec[Qu.r]=b->lchild;
            Qu.r=Qu.r+1;
        }
        if(b->rchild!=NULL)
        {
            printf("%c ",b->rchild->data);
            Qu.vec[Qu.r]=b->rchild;
            Qu.r=Qu.r+1;
        }
    }
    printf("
");
}