线索二叉树

二叉树的线索化的主要思想是将为使用的左右子树的指针利用，左指针指向前驱节点，右指针指向后继节点。

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

typedef  enum            //定义线索二叉树标志
{
    Link,
    Thread
}PointerTag;

typedef struct BiNode
{
    int data;
    struct BiNode *lchild, *rchild;
    PointerTag LTag, RTag;
}BiNode, *BiTree;

BiTree pre;  //定义pre为全局变量，为二叉树线索化中的前节点

void CreatTree (BiTree *T)
{
    int data;
    scanf("%d", &data);
    if(data == -1)
    {
        *T = NULL;
        return;
    }
    else
    {
        *T = (BiTree)malloc(sizeof(BiNode));
        (*T)->data = data;
        printf("Enter Left Child:");
        CreatTree(&((*T)->lchild));
        printf("Enter Right Child:");
        CreatTree(&((*T)->rchild));
    }
}

void InThread (BiTree T)          //二叉树线索化
{
    if(T)
    {
        InThread(T->lchild);
        if(!(T->lchild))          //如果左子树指针为空，则将指针链接到中序遍历中的上一个节点
        {
            T->lchild = pre;
            T->LTag = Thread;
        }
        else
        {
            T->LTag = Link;
        }
        if(!(pre->rchild))         //如果右子树指针为空，则将指针链接到中序遍历中的下一个节点
        {
            pre->rchild = T;
            pre->RTag = Thread;
        }
        else
        {
            pre->RTag = Link;
        }
        pre = T;
        InThread(T->rchild);
    }
}

BiTree InOrderThread (BiTree T)
{
    BiTree Thr;
    Thr = (BiTree)malloc(sizeof(BiNode));     //创建先驱节点，指向根节点
    Thr->RTag = Thread;
    Thr->LTag = Link;
    Thr->rchild = Thr;
    if(!T)
    {
        Thr->lchild  = Thr;
    }
    else
    {
        Thr->lchild = T;
        pre = Thr;
        InThread(T);
        pre->rchild = Thr;
        pre->RTag = Thread;
        Thr->rchild = pre;
    }
    return Thr;
}

void InOrderPrint (BiTree T)
{
    BiTree p;
    p = T->lchild;     //p指向根节点
    while(p != T)
    {
        while(p->LTag == Link)
        {
            p = p->lchild;
        }
        printf("%d\n", p->data);
        while(p->RTag == Thread && p->rchild != T)
        {
            p = p->rchild;
            printf("%d\n", p->data);
        }
        p = p->rchild;
    }
//    printf("%d\n", p->data);
}

int main ()
{
    BiTree T;
    CreatTree(&T);
    T = InOrderThread(T);
    InOrderPrint(T);
    return 0;
}

参考博客： https://blog.csdn.net/c18219227162/article/details/50188579