二叉树的索引化

二叉树的索引化

typedef char datatype
typedef struct node{  /*穿线二叉树节点的类型定义*/
datatype data;
int ltag ,rtag;
struct node *lchild, *rchild;
}binthrnode, *binthrtree;

binthrtree pre = NULL;
binthrtree createbintree()  /*按前序遍历建立二叉树*/
{
	char ch;
	binthrtree t;
	if((ch=getchar())=='#')
	t = NULL:
	else{
	t = (binthrtree*)malloc(sizeof(binthrtree)); /*生成节点*/
	t->data = ch;
	t->lchild=createbintree(); /*创建左子树*/
	t->rchild = createbintree(); /*创建右子树*/
	}
return t;
}
void inthreading(binthrtree *p){
	if(*p){
		inthreading(&((*p)->lchild));
		(*p)->ltag=((*p)->lchild)?0:1;
		(*p)->rtag=((*p)->lchild)?0:1;
		if(pre)
		{
			if(*p)
			{
				if(pre->rtag==1) pre->rchild = *p;
				if((*p)->ltag==1) (*p)->lchild=pre;
			}
			pre=*p;
			inthreading(&((*p)->lchild));
		}
	}
}

void createthrtree(binthrtree *p)
{
	*p = createbintree();
	createthrtree(p);
}

int main()
{
	binthrtree root;
	reatethrtree(&root);
}