线索化二叉树

我们把指向前驱或者后继的指针称为线索，加上线索的指针就称之为线索二叉树

#include

using namespace std;

typedef char Elemtype;

typedef enum{Link,Thread} PointTag;

typedef struct BiTNode
{
Elemtype data;
BiTNode *lchild,*rchild;
PointTag LTag,RTag;
}BiTNode,*BiTree;

BiTNode * BuyBiTNode(Elemtype val)
{
BiTNode * s = new BiTNode();
s->data = val;
s->LTag = Link;
s->RTag = Link;
return s;
}

BiTree CreatBiTree()
{
Elemtype tmp;
scanf("%c",&tmp);
BiTree T = NULL;
if(tmp == ‘#’);
else
{
T = BuyBiTNode(tmp);
T->lchild = CreatBiTree();
T->rchild = CreatBiTree();
}
return T;
}

BiTNode *pre;

void InThreading(BiTree p)
{
if§
{
InThreading(p->lchild);
if(!(p->lchild))//没有左孩子
{
p->LTag = Thread;
p->lchild = pre;
}
if(pre != NULL && !(pre->rchild))//没有有孩子且不是第一个节点
{
pre->RTag = Thread;
pre->rchild = p;
}
pre = p;
InThreading(p->rchild);
}
}

void OrderTraverse_Thr(BiTree T)//线索化中序遍历
{
while(T)
{
while(T->LTag == Link) T = T->lchild;//找到左子树第一个要遍历的节点
printf("%c",T->data);
while(T->RTag==Thread && T->rchild!=NULL)//遍历后继节点
{
T = T->rchild;
printf("%c",T->data);
}
T = T->rchild;//遍历后继节点的右子树
}
}

int main()
{
BiTree T = CreatBiTree();
InThreading(T);
OrderTraverse_Thr(T);
}