1.二叉树的线索化,就是当根节点有左右节点则和二叉树一样,如果没有则left指向它的前驱节点,right指向它的后继节点,以下为线索化,建树,打印线索二叉树的操作
【问题描述】创建一棵二叉树,接着中序线索化该二叉树,然后编写相应函数遍历该中序线索二叉树
【编码要求】线索二叉树遍历过程中不能使用递归、不能使用栈。
【输入形式】二叉树拓展的前序遍历序列
【输出形式】中序遍历序列
【样例输入】AB#D##CE###
【样例输出】BDAEC
思路:set函数,使用一个前驱节点以改变left,如果根节点为空则返回,左节点为空则赋值前驱节点,如果前驱节点的右节点为空且前驱节点不为空,将它的后继节点赋值为当前根节点,并且更新前驱节点为当前节点,前序打印的思路首先找到最左侧且不是线索节点的节点,并且打印数据,饭后一直打印后继节点,并且结束后让根节点移动到右节点,creat就是按普通二叉树的构建
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
typedef struct tree
{
char data;
tree* left;
tree* right;
int lflag;
int rflag;
}tree;
tree* pre;
void set(tree* root)
{
tree* point = root;
if (point == nullptr)
{
return;
}
set(point->left);
if (point->left == nullptr)
{
point->left = pre;
point->lflag = 1;
}
if (pre != nullptr && pre->right == nullptr)
{
pre->right = root;
pre->rflag = 1;
}
pre = point;
set(root->right);
}
void print(tree* point)
{
tree*root = point;
while (root)
{
while (root->lflag==0)
{
root = root->left;
}
cout << root->data;
while (root->rflag == 1 && root->right != nullptr)
{
root = root->right;
cout << root->data;
}
root = root->right;
}
}
tree* creat(string& s, int& i)
{
if (i > s.size() || s[i] == '#')
{
i++;
return nullptr;
}
else
{
tree* root = new tree;
root->data = s[i++];
root->left = creat(s, i);
root->right = creat(s, i);
root->lflag = root->rflag = 0;
return root;
}
}
int main()
{
pre = nullptr;
string s;
char a;
cin >> s;
int i = 0;
tree* root = creat(s,i);
set(root);
print(root);
return 0;
}
2.二叉树的树状打印
问题在于打印函数,需要带一个depth来打印空格
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
typedef struct tree
{
char data;
tree* left;
tree* right;
}tree;
tree* creat(string& s, int& i)
{
if (i >= s.size() || s[i] == '.')
{
i++;
return nullptr;
}
tree* root = new tree;
root->data = s[i++];
root->left = creat(s, i);
root->right = creat(s, i);
return root;
}
void print(tree* root, int depth)
{
if (root == nullptr)
{
return;
}
print(root->left, depth + 1);
for (int i = 0; i < depth; i++)
{
cout << ' ';
}
cout << root->data<<endl;
print(root->right, depth + 1);
}
int main()
{
string arr;
cin >> arr;
int i = 0;
tree* root = creat(arr, i);
print(root, 0);
return 0;
}