中序二叉线索树

最新推荐文章于 2025-07-29 21:31:10 发布

smart_jackli

最新推荐文章于 2025-07-29 21:31:10 发布

阅读量138

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构文章标签： c++ 算法数据结构

本文链接：https://blog.youkuaiyun.com/smart_jackli/article/details/127797108

数据结构专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一段C++代码，通过InThread函数实现了二叉树的创建和插入操作。重点在于展示了如何使用递归在二叉树中进行中序遍历，展示了结构体Tnode的定义以及核心函数如creatTree、InThread和createIn的操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

完整代码：

#include<iostream>
using namespace std;
typedef struct Tnode {
	int data;
	struct Tnode* lchild, * rchild;
	int ltag = 0;
	int rtag = 0;
}*Tree;
void creatTree(Tree &T)
{
	T = new Tnode;
	T->data = 1;
	Tree p1 = new Tnode;
	Tree p2 = new Tnode;
	Tree p3 = new Tnode;
	Tree p4 = new Tnode;
	Tree p5 = new Tnode;
	p1->data = 2;
	p2->data = 3;
	p3->data = 4;
	p4->data = 5;
	p5->data = 6;
	T->lchild = p1;
	T->rchild = p2;
	p1->lchild = p3;
	p1->rchild = p4;
	p2->lchild = p5;
	p2->rchild = NULL;
	p3->lchild = NULL;
	p3->rchild = NULL;
	p4->lchild = NULL;
	p4->rchild = NULL;
	p5->lchild = NULL;
	p5->rchild = NULL;
}
void InThread(Tree &p,Tree &pre) {
	if (p != NULL)
	{
		InThread(p->lchild, pre);
		if (p->lchild == NULL)
		{
			p->lchild = pre;
			p->ltag = 1;
		}
		if (pre != NULL && pre->rchild == NULL)
		{
			pre->rchild = p;
			pre->rtag = 1;
		}
		pre = p;
		InThread(p->rchild, pre);
	}
}
void createIn(Tree T) {
	Tree pre = NULL;
	if (T != NULL)
	{
		InThread(T, pre);
		pre->rchild = NULL;
		pre->rtag = 1;
	}
}
void visitTree(Tree &T) {
	while (T->ltag == 0) T = T->lchild;
	cout << T->data<<" ";
}
void midvi(Tree T)
{
	if (T != NULL)
	{
		midvi(T->lchild);
		if(T->ltag == 1) cout << T->data << " ";
		midvi(T->rchild);
	}
}
int main() {
	Tree T;
	creatTree(T);
	createIn(T);
	//midvi(T);
	Tree p = new Tnode;
	p = T;
	visitTree(p);
	return 0;
}