线索二叉树实现

最新推荐文章于 2024-07-29 08:47:18 发布

_Neha

最新推荐文章于 2024-07-29 08:47:18 发布

阅读量109

点赞数

分类专栏：造轮子笔记

本文链接：https://blog.csdn.net/qq_22272275/article/details/120879791

版权

二叉树中序遍历循环 C++ 数据结构

关键词由CSDN通过智能技术生成

造轮子同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

笔记

7 篇文章 1 订阅

订阅专栏

#include<iostream>
using namespace std;

#define MAX 10
typedef int ElemType;
typedef int status;

typedef struct Ptree {

	ElemType data;
	struct Ptree* lchild, * rchild;
	int ltool,rtool;



}Ptree;
typedef struct Ptree* tree;
tree pr = NULL;    /*全局变量*/

status Initlink(tree* t)
{
	ElemType ch;
	cout << "请输入值" << endl;
	cin >> ch;
	tree p = new  Ptree;
	p->data = ch;
	p->ltool = 0;
	p->rtool = 0;

	if (ch == -1)
	{
		cout << "ok,此时为空" << endl;
		(*t) = NULL;
		return 1;
	}
	(*t) = p;
	Initlink(&(*t)->lchild);
	Initlink(&(*t)->rchild);
	cout << "sbsbsb" << (*t)->data << endl;
	return 0;
}



void recreative(tree t)
{
	

	if (t)
	{
		recreative(t->lchild);
		if (t->lchild == NULL)
		{
			t->lchild = pr;
			t->ltool = 1;
		}
		if (pr&&!pr->rchild)
		{
			pr->rchild = t;
			pr->rtool = 1;
		
		}
		pr = t;
		recreative(t->rchild);
	}
	
	
	

}
void print(tree t)
{
	while (t->ltool == 0)
		t = t->lchild;
	cout << t->data;
	while (t->rtool == 1)
	{
		t = t->rchild;
		cout << t->data;
		if (t->rtool == 0)
		{
			t = t->rchild;
		}
		while (t->ltool == 0)
			t = t->lchild;
		cout << t->data;


	}
	
}
int main()
{
      /*使用头结点，可以从前或后使用中序*/
	tree t;
	t = new Ptree;
	t->ltool = 0;
	t->rtool = 1;

	Initlink(&(t->lchild));
	
	recreative(t);
	print(t);


}