线索二叉树的建立与遍历

最新推荐文章于 2021-12-19 19:15:42 发布

andyyang0212

最新推荐文章于 2021-12-19 19:15:42 发布

阅读量386

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/andyyang0212/article/details/40015967

版权

数据结构与算法专栏收录该内容

26 篇文章 1 订阅

订阅专栏

struct threadedtree{
	int leftthread;
	struct left;
	int rightready;
	struct right;
	int n;
}

struct threadedtree *pre;
void InThreading(threadedtree *t){
	if(t){
		InThreading(t->left);
		if(!t->left){
			t->leftready = 1;
			t->left = pre;
		}
		else t->leftready = 0;
		if(!pre->right){
			pre->right = t;
			pre->rightready = 1;
		}
		else pre->rightready = 0;
		pre = t;
		InThreading(p->right);
	}
}

struct threadedtree* Inorder_threading(struct threadedtree *t){
	struct threadedtree* head;
	head = (struct threadedtree*)malloc(sizeof(struct threadedtree));
	head->right = head;
	head->rightready = 0;
	head->leftready = 0;
	if(!t) head->left = head;
	else{
		head->left = t;
		pre = head;
		InThreading(t);
		pre->right = head;
		pre->right = 1;
	}
}
void Inordertraversal(struct threadedtree *t){
   while(t->right != t){
   	while(!t->leftready)
   		t = t->left;
   	    visit(t);
   	    while(t->rightready&&t->right!=t){
   	    	t = t->right;
   	    	visit(t->right);
   	    }
   	    t = t->right
   }
}