# 1020. Tree Traversals (25)

400 ms

32000 kB

16000 B

Standard

CHEN, Yue

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7

Sample Output:
4 1 6 3 5 7 2
推荐指数：※※
来源：http://pat.zju.edu.cn/contests/pat-a-practise/1020
1.一种方法是利用后序和中序构造出树后再BFS。
2.另一种，不构造出数，每次直接计算出每个节点的左右儿子节点。
a.左儿子：通过中序计算出当前节点右子数的节点数量，再通过后序遍历中当前节点位置减去当前节点右子树的数量，后的位置（其实中序就是要来确定当前节点右子树的大小的）。
rsize=right_size(root);
left=hash_post[root]-rsize-1;

b.右儿子就是后序遍历当前node的前一个节点。right=hash_post[root]-1;
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
int *post,*visited;
const int N=31;
int hash_post[N],hash_in[N];
int n;
int right_size(int root){
int i=0,size=0;
for(i=hash_in[root]+1;i<=n-1;i++){
if(visited[i]==false)
size++;
else
break;
}
return size;
}
int main()
{
cin>>n;
post=new int[n];
visited=new int [n];
int i,tmp;
for(i=0;i<n;i++){
cin>>post[i];
hash_post[post[i]]=i;
}
for(i=0;i<n;i++){
cin>>tmp;
hash_in[tmp]=i;
}
memset(visited,0,n*sizeof(int));
queue<int> q;
q.push(post[n-1]);
int right=n-1;
cout<<post[n-1];
visited[hash_in[post[n-1]]]=true;
while(!q.empty()){
int root=q.front();
int rsize=right_size(root);
int left=hash_post[root]-rsize-1;//handle left sub tree root
if(left>=0&&visited[hash_in[post[left]]]==false){
int left_root=post[left];
cout<<" "<<left_root;
visited[hash_in[left_root]]=true;
q.push(left_root);
}
int right=hash_post[root]-1;//handle right sub tree root
if(right>=0&&visited[hash_in[post[right]]]==false){
int right_root=post[right];
cout<<" "<<right_root;
visited[hash_in[right_root]]=true;
q.push(right_root);
}
q.pop();
}
return 0;
}

题目1385：重建二叉树


81 2 4 7 3 5 6 84 7 2 1 5 3 8 681 2 4 7 3 5 6 84 1 2 7 5 3 8 6

7 4 2 5 8 6 3 1 No

来源：http://ac.jobdu.com/problem.php?pid=1385
这是基本的根据前序、中序构造后序。
#include<iostream>
using namespace std;
typedef struct node
{
int val;
node *left;
node *right;
}node;
bool flag;
node * rebuild(int *pre,int *in ,int length){
node *root=new node();
root->val=pre[0];
root->left=NULL;
root->right=NULL;
int index;
for(index=0;index<length;index++)
if(in[index]==root->val)
break;
if(index>=length){
flag=true;
return NULL;
}
if(index>0)
root->left=rebuild(pre+1,in,index);
if(length-index-1>0)
root->right=rebuild(pre+index+1,in+index+1,length-index-1);
return root;
}
void print_post(node* root){
if(root!=NULL){
print_post(root->left);
print_post(root->right);
cout<<root->val<<" ";
}
}
int main()
{
int n,i;
while( cin>>n){
flag=false;
int *pre=new int[n];
int *in=new int[n];
for(i=0;i<n;i++)
cin>>pre[i];
for(i=0;i<n;i++)
cin>>in[i];
node *root;
root=rebuild(pre,in,n);
if(flag==true)
cout<<"No"<<endl;
else{
print_post(root);
cout<<endl;
}
}
return 0;
}

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客