1020 Tree Traversals （25 分）

 

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

ps：根据后序，中序输出层序

#include<cstdio>
#include<queue>
#include<iostream>
using namespace std;
struct treeNode{
	int date;
	treeNode* left=NULL;
	treeNode* right=NULL;
};
int n;
int in[30]={0},post[30]={0},pre[30]={0};
treeNode* preorder(int root,int start,int end){
	if(start>end)
		return NULL;
	int i = start;
	while(post[root]!=in[i]&&i<end) i++;
	treeNode* node = new treeNode;
	node->date = post[root];
	node->left = preorder(root-(end-i+1),start,i-1);
	node->right = preorder(root-1,i+1,end);
	return node;
}
bool flag = true;
void layer(treeNode* root){
	queue<treeNode*> q;
	q.push(root);
	while(!q.empty()){
		treeNode* now = q.front();
		printf("%s%d",flag == true? "" : " " ,now->date);
		flag = false;
		q.pop();
		if(now->left!=NULL)
			q.push(now->left);
		if(now->right!=NULL)
			q.push(now->right);
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>post[i];
	}
	for(int i=0;i<n;i++){
		cin>>in[i];
	}
	layer(preorder(n-1,0,n-1));
}