中序遍历实现线索化二叉树（非递归带头结点）C语言版

#include <stdio.h>
#include <stdlib.h>
//所使用的前序输入的树ABC##DE#G##F###


typedef enum pointertag{
    link,
    Thread
}Pointertag;

typedef struct BiTrNode{
    char data;
    struct BiTrNode *lchild,*rchild;
    Pointertag Ltag,Rtag;
}BiTrNode,*BiTree;

BiTree pre = NULL;//pre指针在此定义为全局变量

void createNode(BiTree *Tree){
    char data;
    scanf("%c",&data);
    if(data!='#'){
        if(!((*Tree)=(BiTrNode*)malloc(sizeof(BiTrNode)))){
            printf("分配空间失败。");
            return;
        }else{
            (*Tree)->Ltag=link;
            (*Tree)->Rtag=link;
            (*Tree)->data = data;
            createNode(&((*Tree)->lchild));
            createNode(&((*Tree)->rchild));
        }
    }else{
        *Tree = NULL;
    }
}
//用双指针构建二叉树则不需要返回值,当然也可以采取用单指针返回单指针的方式

//对二叉树进行线索化递归方法
/*void inThread(BiTree p){
    if(p){
        inThread(p->lchild);//线索化当前左子树
        if(!p->lchild){
            p->Ltag = Thread;
            p->lchild = pre;
        }
        if(pre&&!pre->rchild){
            pre->Rtag = Thread;
            pre->rchild = p;
        }
        pre = p; 
        inThread(p->rchild);//对右子树进行递归线索化
    }
}*/

//build threaded binary tree inorder without recursion
void inorderThread(BiTree t,BiTree *thr){
    BiTree s[100];
    int top = 0;
    BiTree p;
    if(!((*thr)=(BiTrNode*)malloc(sizeof(BiTrNode)))){
        printf("分配头结点空间失败。\n");
        return;
    }
    
    (*thr)->Ltag = link;//头结点有左标签为link
    (*thr)->Rtag = Thread;//右标签为thread
    (*thr)->rchild = *thr;//头结点回指自己
    if(!t) (*thr)->rchild = *thr;
    else{
        p = t;
        (*thr)->lchild = p;
        pre = *thr;
        while(p!=NULL||top!=0){
            while(p!=NULL){
                s[top++] = p;
                p = p->lchild;
            }
            if(top>0){
                p = s[--top];
                if(pre->rchild==NULL){
                    pre->rchild = p;
                    pre->Rtag = Thread;
                }
                if(p->lchild==NULL){
                    p->lchild = pre;
                    p->Ltag = Thread;
                }
                pre = p;
                p = p->rchild;
            }
        }
        pre->rchild = *thr;//最后一个结点回指头结点
    }
}




void inOrderTraversal(BiTree head){
    //中序遍历的实现，规律先穷尽根节点的左子树，打印最左边节点，同时看其标志域，若断掉则访问该结点的右孩子，再进行左子树遍历
    BiTree p;
    p = head->lchild;
    while(p!=head){
        while(p->Ltag==link){
            p = p->lchild;
        }
        printf("%c\t",p->data);
        while(p->Rtag==Thread&&p->rchild!=head){
            p = p->rchild;
            printf("%c\t",p->data);
        }
        p = p->rchild;
    }
}

int main(){
    BiTree t,head;
    printf("输入前序二叉树:\n");
    createNode(&t);
    inorderThread(t,&head);
    printf("输出中序序列：\n");
    inOrderTraversal(head);
}