【数据结构与算法】二叉树的建立与线索化

#include <stdio.h>
#include <stdlib.h> 
#include <string.h>
#define MAXSIZE 100
typedef enum{Link,Thread} PointerTag; 

// 输入前序遍历，创建一棵树 

typedef struct BitNode
{
	char data;
	struct BitNode *lchild,*rchild;
	PointerTag ltag,rtag;
}BitNode;
typedef struct BitNode *  BiTree;
//全局变量，指向刚访问的节点
BiTree pre;  
//建立二叉树 
void CreateT(BiTree *T)
{   
    char c;
    scanf("%c",&c);
   	if( '#' == c)
   	{
	  *T = NULL;  	
    }
    else
    {
        *T=(BitNode *)malloc(sizeof(BitNode));
	    (*T)->data = c;
	    (*T)->ltag=Link;
    	(*T)->rtag=Link;
	   	CreateT(&(*T)->lchild);   	
	   	CreateT(&(*T)->rchild);
	   
    }
}

//中序遍历二叉树
void InOrderTraverce(BiTree T)
{    
	 if ( T )
	 {
 	    InOrderTraverce( T -> lchild);
 	    if( ! T-> lchild)
 	    {
    	    T->ltag =Thread;
			T->lchild = pre; 	
	    }
	    if( ! pre-> rchild)
	    {
            pre->rtag = Thread;
            pre->rchild = T;
    	}
	    pre =T;
 	    InOrderTraverce( T -> rchild);	 	
 	 } 
	
}
void InOrderThreading(BiTree *p,BiTree T)
{
	*p=(BiTree)malloc(sizeof(BitNode));
	(*p)->ltag =Link;
	(*p)->rtag =Thread;
	(*p)->rchild = *p;
	if( !T)
	{
		(*p)->lchild =*p;
	}
	else
	{
		(*p)->lchild = T;
		pre = *p;
		InOrderTraverce(T);
		pre->rchild = *p;
		pre->rtag = Thread;
		(*p)->rchild =pre;
	}
} 

void ZHONGXU(BiTree T)
{   
	if( T )
	{
		ZHONGXU(T->lchild);
		printf("%c",T->data);
		ZHONGXU(T->rchild);		
	}
}



int main()
{
	//int level=1;
	BiTree P=NULL,T=NULL;
	CreateT(&T);
	//InOrderTraverce(T);
	InOrderThreading(&P,T);
	ZHONGXU(T);
	return 0;
}