建立线索二叉树

先序建立线索二叉树并实现访问前节点与后节点的函数

#include<iostream>
#include<stdio.h>


//如需修改数据类型，可在此修改
#define ElementType char
/*线索二叉树*/

//结构体的定义
typedef struct Thread_Tree* Thread_Pointer;

//建立一个全局的静态变量为建立线索连接所服务，指向前驱节点
static Thread_Pointer PreNode=NULL;
typedef struct Thread_Tree {
	ElementType data;

	//0代表孩子     1代表线索
	short int Ltag;   //1表示前驱     0表示左孩子    
	short int Rtag;  //1表示后继     0表示右孩子

	Thread_Pointer left_Child;
	Thread_Pointer right_Child;
	//下一个节点
	Thread_Pointer nextNode(Thread_Pointer p);
	//前节点
	Thread_Pointer preNode(Thread_Pointer p);

	//前序建立
	void CreateBithread(Thread_Pointer &T);
	//建立线索连接
	void InOrderThreading(Thread_Pointer& T);
	void InThreading(Thread_Pointer&T);
};

Thread_Pointer Thread_Tree::nextNode(Thread_Pointer p) {
	if (p->Rtag)return p->right_Child;
	Thread_Pointer next = p->right_Child;
	while (!next->Ltag)
	{
		next = next->left_Child;
	}
	return next;
}
Thread_Pointer Thread_Tree::preNode(Thread_Pointer p) {
	if (p->Ltag)return p->left_Child;
	Thread_Pointer pre=p->left_Child;
	while (!pre->Rtag)
	{
		pre = pre->right_Child;
	}
	return pre;
}
void Thread_Tree::CreateBithread(Thread_Pointer& T) {
   //输入树的节点信息，例如‘abdg###e##c#f##’,其中#代表空
	ElementType ch;
	scanf_s("%c",&ch);
	if (ch == '#')T = NULL;
	else
	{
		T = (Thread_Pointer)malloc(sizeof(Thread_Tree));
		if (!T)exit(OVERFLOW);
		T->data = ch;
		T->Ltag = 1;    //默认都没有孩子
		T->Rtag = 1;

		CreateBithread(T->left_Child);
		if (T->left_Child)T->Ltag = 0; 

		CreateBithread(T->right_Child);
		if (T->right_Child)T->Rtag = 0;
	}
}

void Thread_Tree::InOrderThreading(Thread_Pointer& T) {
	//建立头结点
	Thread_Pointer head = (Thread_Pointer)malloc(sizeof(Thread_Tree));
	head->Ltag = 0;
	head->Rtag = 1;
	head->right_Child = head;//右指针回指
	if (!T)head->left_Child = head;//左指针回指
	else
	{
		head->left_Child = T;
		PreNode = head;
		//中序遍历进行线索化
		InThreading(T);

		PreNode->right_Child = head;//最后一个节点字点线索化
		head->right_Child = PreNode;//实际应用中将其指向尾结点
	}
	T = head;//重新指向头结点
}
void Thread_Tree::InThreading(Thread_Pointer& T) {
	if (T) {
		//左子树线索化
		InThreading(T->left_Child);

		if (T->Ltag)T->left_Child = PreNode;
		if (PreNode->Rtag)PreNode->right_Child = T;
		PreNode = T;//保持preNode始终指向T的前驱

		InThreading(T->right_Child);
	}

}
int main() {
   //test
	std::cout << "请输入树的节点信息，例如‘abdg###e##c#f##’,其中#代表空" << std::endl;
	Thread_Pointer Test_Tree;
	Test_Tree->CreateBithread(Test_Tree);
	Test_Tree->InOrderThreading(Test_Tree);

	//可在堆栈查看结果是正确的
	system("pause");
}