本题要求根据给定的一棵二叉树的后序遍历和中序遍历结果,输出该树的先序遍历结果。
输入格式:
第一行给出正整数N(≤30),是树中结点的个数。随后两行,每行给出N个整数,分别对应后序遍历和中序遍历结果,数字间以空格分隔。题目保证输入正确对应一棵二叉树。
输出格式:
在一行中输出Preorder:
以及该树的先序遍历结果。数字间有1个空格,行末不得有多余空格。
输入样例:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7
输出样例:
Preorder: 4 1 3 2 6 5 7
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
#include <stdio.h>
#include <stdlib.h>
int Post[30]; //后序数组
int In[30]; //中序数组
typedef struct TreeNode_ {
int data;
struct TreeNode_* left;
struct TreeNode_* right;
}TreeNode, *PTreeNode;
PTreeNode BuildTree(int* Post, int* In, int n);
void PreOrder(PTreeNode t);
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &Post[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &In[i]);
}
PTreeNode t = BuildTree(Post, In, n);
printf("Preorder:");
PreOrder(t);
return 0;
}
PTreeNode BuildTree(int* Post, int* In, int n) {
if (n <= 0) {
return NULL;
}
int* p = In;
while (1) {
if (*p == *(Post + n - 1))
break;
p++;
}
PTreeNode Root = (TreeNode*)calloc(1, sizeof(TreeNode));
Root->data = *p;
int Length = p - In;
Root->left = BuildTree(Post, In, Length);
Root->right = BuildTree(Post + Length, p + 1, n - Length - 1); //post与p进入的元素一样
return Root;
}
void PreOrder(PTreeNode t) {
if (t) {
printf(" %d", t->data);
PreOrder(t->left);
PreOrder(t->right);
}
return;
}