数据结构 - 线索二叉树的创建和遍历

1、采用书上第133页定义的线索二叉树的线索链表存储表示，编写实现二叉树的下列基本操作。
建立中序线索二叉树 中序遍历线索二叉树

9.1

//2020.11.13

#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
typedef char TElemType;

typedef enum { Link, Thread } PointerTag;

typedef struct BiThrNode {
  TElemType data;
  struct BiThrNode *lchild, *rchild;
  PointerTag LTag;
  PointerTag RTag;
}BiThrNode, *BiThrTree;

Status CreateBiThrNode(BiThrTree * B) {
  char ch;
  scanf("%c", &ch);
  if(ch=='#') *B = NULL;
  else{
    if(!((*B) = (BiThrNode *)malloc(sizeof(BiThrNode)))) exit(OVERFLOW);
    (*B)->data = ch;
    (*B)->LTag = Link;
    (*B)->RTag = Link;
    CreateBiThrNode(&(*B)->lchild);
    CreateBiThrNode(&(*B)->rchild);
  }
  return OK;
}

void InThreading(BiThrTree B,BiThrTree *pre) {
  if(!B) return;
  InThreading(B->lchild,pre);
  if(!B->lchild) {
    B->LTag = Thread;
    B->lchild = *pre;
  }
  if(!(*pre)->rchild) {
    (*pre)->RTag = Thread;
    (*pre)->rchild = B;
  }
  *pre = B;
  InThreading(B->rchild,pre);
}

Status InOrderThreading(BiThrTree *Thrt,BiThrTree T){
  if(!(*Thrt = (BiThrTree)malloc(sizeof(BiThrNode)))) exit(OVERFLOW);
  (*Thrt)->LTag = Link;
  (*Thrt)->RTag = Thread;
  (*Thrt)->rchild = (*Thrt);
  if(!T) {
    (*Thrt)->lchild = (*Thrt);
    return OK;
  }
  BiThrTree pre;
  pre = (*Thrt);
  (*Thrt)->lchild = T;
  InThreading(T,&pre);
  pre->rchild = *Thrt;
  pre->RTag = Thread;
  (*Thrt)->rchild = pre;
  return OK;
}

Status InOrderTraverse(BiThrTree T) {
  BiThrNode *p = T->lchild;
  while(p != T) {
    while(p->LTag == Link) p = p->lchild;
    printf("%c",p->data );
    while(p->RTag == Thread && p->rchild!=T) {
      p = p->rchild;
      printf("%c",p->data );
    }
    p = p->rchild;
  }
  return OK;
}

int main() { //测试数据:abc##de#g##f###
  BiThrTree T,Thrt;
  printf("创建线索二叉树,按先序次序输入线索二叉树中结点的值: \n");
  CreateBiThrNode(&T);
  if(InOrderThreading(&Thrt,T) == OK) printf("成功建立中序线索化链表!\n");
  printf("中序遍历线索二叉树,结果为：\n");
  InOrderTraverse(Thrt);
  printf("\n");
}