玩转二叉树
给定一棵二叉树的中序遍历和前序遍历,请你先将树做个镜面反转,再输出反转后的层序遍历的序列。所谓镜面反转,是指将所有非叶结点的左右孩子对换。这里假设键值都是互不相等的正整数。
输入格式:
输入第一行给出一个正整数N(≤30),是二叉树中结点的个数。第二行给出其中序遍历序列。第三行给出其前序遍历序列。数字间以空格分隔。
输出格式:
在一行中输出该树反转后的层序遍历的序列。数字间以1个空格分隔,行首尾不得有多余空格。
input
7
1 2 3 4 5 6 7
4 1 3 2 6 5 7
output
4 6 1 7 5 3 2
反思
- 根据中序遍历和前序遍历创建二叉树
- 镜像反转
- 根据层序遍历输出
三个要点都不熟练。。。四舍五入就是二叉树这一部分基本都忘光了
代码
#include <iostream>
#include <stdlib.h>
#include <queue>
using namespace std;
typedef struct Tree
{
int data;
struct Tree* left;
struct Tree* right;
}*BinTree;
BinTree create(int pre[], int mid[], int length)
{
if (length == 0)
return NULL;
BinTree bt1 = (BinTree)malloc(sizeof(struct Tree));
bt1->data = pre[0];
int index = 0;
while (mid[index] != pre[0])
index++;
bt1->left = create(pre + 1, mid, index);
bt1->right = create(pre + index + 1, mid + index + 1, length - index - 1);
return bt1;
}
void mirror(BinTree& bt)
{
BinTree node = (BinTree)malloc(sizeof(struct Tree));
node = bt->left;
bt->left = bt->right;
bt->right = node;
if (bt->left != NULL)
mirror(bt->left);
if (bt->right != NULL)
mirror(bt->right);
}
void printTree(BinTree bt)
{
int flag = 0;
queue<BinTree> q;
q.push(bt);
while (!q.empty())
{
BinTree node = q.front();
q.pop();
if (flag == 0)
{
cout << node->data;
flag = 1;
}
else
cout << " " << node->data;
if (node->left)
q.push(node->left);
if (node->right)
q.push(node->right);
}
cout << endl;
}
int main()
{
int n;
int pre[40];
int mid[40];
cin >> n;
for (int i = 0; i < n; i++)
cin >> mid[i];
for (int i = 0; i < n; i++)
cin >> pre[i];
BinTree bt = create(pre, mid, n);
mirror(bt);
printTree(bt);
return 0;
}