数据结构C语言-线索二叉树

#include <stdio.h>
#include <stdlib.h>

#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int status;
typedef char ElemType;


typedef struct BiThrNode
{
    ElemType data;
    struct BiThrNode *lchild,*rchild;
    int LTag,RTag;
}BiThrNode,*BiThrTree;

BiThrNode *pre;
void InThreading(BiThrTree p)
{
    if(p)
    {
        InThreading(p->lchild);
        if(!p->lchild)
        {
            p->LTag=1;
            p->lchild=pre;
        }
        else
            p->LTag=0;
        if(!pre->rchild)
        {
            pre->RTag=1;
            pre->rchild=p;
        }
        else
            p->RTag=0;
        pre=p;
        InThreading(p->rchild);
    }
}

void InOrderThreading(BiThrTree *Thrt,BiThrTree T)
{
    *Thrt=(BiThrNode *)malloc(sizeof(BiThrNode));
    (*Thrt)->LTag=0;
    (*Thrt)->RTag=1;
    (*Thrt)->rchild=Thrt;
    if(!T)
        (*Thrt)->lchild=Thrt;
    else
    {
        (*Thrt)->lchild=T;
        pre=*Thrt;
        InThreading(T);
        pre->rchild=*Thrt;
        pre->RTag=1;
        (*Thrt)->rchild=pre;
    }
}

void CreateBiThrTree(BiThrTree *T)
{
    char ch;
    scanf("%c",&ch);
    getchar();
    if (ch == '#')
    {
        *T = NULL;
        return;
    }
    else
    {
        *T = (BiThrTree)malloc(sizeof(BiThrNode));
        (*T)->data = ch;
        printf("%c的左孩子:\n",ch);
        CreateBiThrTree(&((*T)->lchild));
        printf("%c的右孩子:\n",ch);
        CreateBiThrTree((&(*T)->rchild));
    }

    return;
}

void InOrderTraverse_Thr(BiThrTree T)
{
    BiThrNode *p=T->lchild;
    while(p!=T)
    {
        while(p->LTag==0)
            p=p->lchild;
        printf("%c ",p->data);
        while(p->RTag==1&&p->rchild!=T)
        {
            p=p->rchild;
            printf("%c ",p->data);
        }
        p=p->rchild;
    }
}

int main()
{
    BiThrTree T,Thrt;
    CreateBiThrTree(&T);
    InOrderThreading(&Thrt,T);
    InOrderTraverse_Thr(Thrt);
    return 0;
}