1020 Tree Traversals (25分)--PAT甲级真题

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

题目大意：分别给出二叉树的后续遍历序列和中序遍历序列，要求输出该二叉树的层次遍历序列。

分析：由后续和中序序列可以唯一确认一棵二叉树；建树之后，后对该二叉树再进行一次层次遍历；

#include<iostream> 
#include<queue> 
using namespace std; 
struct Node{
	Node* lchild;
	Node* rchild;
	int d;
}Tree[31]; 
int loc; 
Node* create(){
	Tree[loc].lchild = Tree[loc].rchild = NULL;
	return &Tree[loc++];
} 
int arr1[31], arr2[31]; 
void LevelOrder(Node* T){
	queue<Node*> Q;
	Q.push(T);
	int flag = 0;
	while (!Q.empty()){
		Node* tmp = Q.front();
		Q.pop();
		if (flag == 0)
			flag = 1;
		else
			printf(" ");
		printf("%d", tmp->d); 
		if (tmp->lchild != NULL)
			Q.push(tmp->lchild);
		if (tmp->rchild != NULL)
			Q.push(tmp->rchild);
	}
} 
Node* build(int s1, int e1, int s2, int e2){
	Node *ret = create();
	ret->d = arr1[e1];
	int rootindex;
	for (int i = s2; i <= e2; i++){
		if (arr2[i] == arr1[e1]){
			rootindex = i;
			break;
		}
	} 
	if (rootindex != s2) //若左子树不为空
		ret->lchild = build(s1, s1 + (rootindex - 1 - s2), s2, rootindex - 1);  
	if (rootindex != e2) //若右子树不为空 
		ret->rchild = build(s1 + (rootindex - 1 - s2) + 1, e1 - 1, rootindex + 1, e2); 
	return ret;
} 
int main(){
	int N;
	scanf("%d", &N);
	loc = 0;
	for (int i = 0; i < N; i++)
		scanf("%d", &arr1[i]);
	for (int i = 0; i < N; i++)
		scanf("%d", &arr2[i]);
	Node* T = build(0, N - 1, 0, N - 1);
	LevelOrder(T); 
	return 0;
}