本篇文章为大家展示了C语言中怎么利用递归实现线索二叉树，内容简明扼要并且容易理解，绝对能使你眼前一亮，通过这篇文章的详细介绍希望你能有所收获。
描述：将二叉树中结点的空左孩子指针域指向前驱结点，将空的右孩子指针域指向后继结点。
code:
计算
安全
数据库
网络和加速
企业服务
#pragma warning(disable:4996)
#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode {
char data;
struct TreeNode *lchild, *rchild;
int ltag, rtag;
}Tree,*BTree;
BTree Build_Tree(void) {
BTree T;
char ch;
scanf("%c", &ch);
if (ch == '#') {
T = NULL;
}
else {
T = (BTree)malloc(sizeof(Tree));
T->data = ch;
T->ltag = 0;
T->rtag = 0;
T->lchild = Build_Tree();
T->rchild = Build_Tree();
}
return T;
}
//先序线索化
void Pre_Thread(BTree cur, BTree *pre) {
if (cur && cur->ltag==0) {
printf("%c ", cur->data);
if (cur->lchild == NULL) {
cur->lchild = *pre;
(*pre)->ltag = 1;
cur->ltag = 1;
}
if (cur->rchild == NULL) {
cur->rtag = 1;
}
if (*pre && (*pre)->rtag == 1) {
(*pre)->rchild = cur;
}
*pre = cur;
Pre_Thread(cur->lchild, pre);
Pre_Thread(cur->rchild, pre);
}
}
//中序线索化
void In_Thread(BTree cur, BTree *pre) {
if (cur) {
In_Thread(cur->lchild, pre);
printf("%c ", cur->data);
if (cur->lchild==NULL) {
cur->lchild = *pre;
cur->ltag = 1;
}
if (cur->rtag == NULL) {
cur->rtag = 1;
}
if (*pre && (*pre)->rtag == 1) {
(*pre)->rchild = cur;
}
*pre = cur;
In_Thread(cur->rchild, pre);
}
}
//后序线索化
void Post_Thread(BTree cur, BTree *pre) {
if (cur) {
Post_Thread(cur->lchild, pre);
Post_Thread(cur->rchild, pre);
printf("%c ", cur->data);
if (cur->lchild == NULL) {
cur->lchild = *pre;
cur->ltag = 1;
}
if (cur->rchild == NULL) {
cur->rtag = 1;
}
if (*pre && (*pre)->rtag == 1) {
(*pre)->rchild = cur;
}
*pre = cur;
}
}
int main(void) {
BTree T,p=NULL;
T = Build_Tree();
Pre_Thread(T, &p);
//In_Thread(T, &p);
//Post_Thread(T, &p);
return 0;
}上述内容就是C语言中怎么利用递归实现线索二叉树，你们学到知识或技能了吗？如果还想学到更多技能或者丰富自己的知识储备，欢迎关注亿速云行业资讯频道。
亿速云「云服务器」，即开即用、新一代英特尔至强铂金CPU、三副本存储NVMe SSD云盘，价格低至29元/月。点击查看>>
免责声明：本站发布的内容（图片、视频和文字）以原创、转载和分享为主，文章观点不代表本网站立场，如果涉及侵权请联系站长邮箱：is@yisu.com进行举报，并提供相关证据，一经查实，将立刻删除涉嫌侵权内容。
