Reconstruction of a Tree

最新推荐文章于 2022-01-20 23:14:04 发布

小菜鸟也有春天

最新推荐文章于 2022-01-20 23:14:04 发布

阅读量347

点赞数 1

分类专栏：数据结构学习

本文链接：https://blog.csdn.net/qq_43257520/article/details/103879669

版权

数据结构学习专栏收录该内容

16 篇文章 1 订阅

订阅专栏

Write a program which reads two sequences of nodes obtained by the preorder tree walk and the inorder tree walk on a binary tree respectively, and prints a sequence of the nodes obtained by the postorder tree walk on the binary tree.

Input
In the first line, an integer
n
, which is the number of nodes in the binary tree, is given.
In the second line, the sequence of node IDs obtained by the preorder tree walk is given separated by space characters.
In the second line, the sequence of node IDs obtained by the inorder tree walk is given separated by space characters.

Every node has a unique ID from
1
to
n
. Note that the root does not always correspond to
1
.

Output
Print the sequence of node IDs obtained by the postorder tree walk in a line. Put a single space character between adjacent IDs.

Constraints
1
≤
n
≤
40
Sample Input 1
5
1 2 3 4 5
3 2 4 1 5
Sample Output 1
3 4 2 5 1
Sample Input 2
4
1 2 3 4
1 2 3 4
Sample Output 2
4 3 2 1

这是xdu期末数据结构机考的一道题

#include<bits/stdc++.h>
using namespace std;
vector<int>pre,in,post;
int pos,n; 
void res(int l,int r){
	if(l>=r)return ;
	int root =pre[pos++];
	int m=distance(in.begin(),find(in.begin(),in.end(),root));
	res(l,m);
	res(m+1,r);
	post.push_back(root);
}
int main(){
	scanf("%d",&n);int k;
	for(int i=0;i<n;i++){
		scanf("%d",&k);pre.push_back(k);
	}
	for(int i=0;i<n;i++){
		scanf("%d",&k);in.push_back(k);
  }
  res(0,n); 
  for(int i=0;i<n;i++){
 		if(i==0)printf("%d",post[i]);
 		else printf(" %d",post[i]);
  } printf("\n");
  
}```