InOrder Tree(Binary List Tree)

void InOrder(LinkBTNode T)
{
    if (T!=NULL)
    {
        InOrder(T->lchild);
        printf("%d\n",T->data);
        InOrder(T->rchild);
    }
}
void InOrder(LinkBTNode T)
{
    const int MaxSize=40;int top=-1;
    LinkBTNode st[MaxSize],p;
    if (T!=NULL)
    {
        top++;
        st[top]=T;p=st[top];
        while(top>-1)
        {
            while(p!=NULL)
            {
                top++;st[top]=p;
                p=p->lchild;
            }
            p=st[top];
            printf("%d\n",p->data);
            top--;
            p=p->rchild;
        }

    }
}

 

转载于:https://www.cnblogs.com/lisongfeng9213/p/3397145.html