楼主,我今晚再把你的代码改了一下,把类型换成了int型的,因为char型的比较相同那里应该就有问题的,还有我上次改的那些,就可以得到想要的结果了,具体代码如下#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef enum{Link,Thread} PointerTag;
// 线索存储标志位
//Link(0):表示指向左右孩子的指针
//Thread(1):表示指向前去后继的线索
typedef struct BinThrNode
{
int data;
struct BinThrNode *lchild,*rchild;
PointerTag ltag;
PointerTag rtag;
}BinThrNode,*BinThrtree;
//全局变量,始终指向刚刚访问过的节点
BinThrNode *pre;
void CreateBinThrtree(BinThrNode **T)
{
int c;
scanf("%d",&c);
if(0== c )
{
*T = NULL;
}
else
{
*T =(BinThrNode *)malloc(sizeof(BinThrNode));
(*T)->data = c;
(*T)->ltag = Link;
(*T)->rtag = Link;
CreateBinThrtree(&(*T)->lchild);
CreateBinThrtree(&(*T)->rchild);
}
}
void InThreading(BinThrNode *T)
{
if(T)
{
InThreading(T->lchild);//递归左孩子线索化
if(!T->lchild) //如果该节点没有左孩子,设置ltag为Thread,并把lchild指向上一个访问的节点
{
T->ltag = Thread;
T->lchild = pre;
}
if(!pre->rchild)
{
pre->rtag = Thread;
pre->rchild = T;
}
pre = T;
InThreading(T->rchild);
}
}
void InOrderThreading(BinThrNode **p,BinThrNode *T)
{
*p = (BinThrNode *)malloc(sizeof(BinThrNode));
(*p)->ltag = Link;
(*p)->rtag = Thread;
(*p)->rchild = *p;
if(!T)
{
(*p)->lchild = *p;
}
else
{
(*p)->lchild = T;
pre = *p;
InThreading(T);
pre->rchild = *p;
pre->rtag = Thread;
(*p)->rchild =pre;
}
}
//中序遍历二叉树,非递归
void visit(int c)
{
printf("%d",c);
}
void InOrderTraverse(BinThrNode *T)
{
BinThrNode *p;
p = T->lchild;
while(p != T)
{
while (p->ltag == Link)
{
p = p->lchild;
}
visit(p->data);
while(p->rtag == Thread && p->rchild!=T)
{
p = p->rchild;
visit(p->data);
}
p = p->rchild;
}
}
// P头指针 T头节点
int main()
{
BinThrNode *P,*T = NULL;
CreateBinThrtree(&T);
InOrderThreading(&P,T);
printf("中序遍历输出:\n");
InOrderTraverse( P );
printf("\n");
return 0;
}
|