PAT 甲级 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.

输入

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.

输出

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.

思路

其实题意很简单，给后序和中序求层次遍历。这里建树是唯一难点，如果不熟悉的同学可以参考本代码建树过程，记住即可。大概方法是可以得知从后序最后一个节点一定为根节点，在中序找到这个节点位置，该节点左右分别为左子树和右子树，递归即可。层次遍历用队列即可。
**注意pat考试中大概率会考到树，和树相关的就是序列建树（本题），二叉搜索树，平衡树等。这些都有较为简单的方法，大家在做的时候记住即可不用死磕，相关题目我在后面说明。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<queue>
using namespace std;
int in[1000];
int post[1000];
vector<int> v;
typedef struct node {
	int key;
	struct node* left;
	struct node* right;
}Tree;
Tree* create(int inL, int inR, int postL, int postR)
{
	if (inL == inR)
	{
		Tree* p = (Tree*)malloc(sizeof(Tree));
		p->key = in[inL];
		p->left = NULL;
		p->right = NULL;
		return p;
	}
	if (inL > inR)
	{
		return NULL;
	}
	int rootId = inL;
	for (; rootId <= inR; rootId++)
	{
		if (in[rootId] == post[postR])
		{
			break;
		}
	}
	Tree* p = (Tree*)malloc(sizeof(Tree));
	p->key = in[rootId];
	p->left = create(inL, rootId - 1, postL, postL + rootId - inL - 1);
	p->right = create(rootId + 1, inR, postL + rootId - inL, postR - 1);
	return p;
}
int main()
{
	int N;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> post[i];
	}
	for (int i = 0; i < N; i++)
	{
		cin >> in[i];
	}
	Tree* head = create(0, N - 1, 0, N - 1);
	queue<Tree*> q;
	q.push(head);
	while (!q.empty())
	{
		Tree* cur = q.front();
		q.pop();
		v.push_back(cur->key);
		if (cur->left != NULL)
		{
			q.push(cur->left);
		}
		if (cur->right != NULL)
		{
			q.push(cur->right);
		}
	}
	for (int i = 0; i < N; i++)
	{
		printf("%d", v[i]);
		if (i < N - 1)
		{
			printf(" ");
		}
	}
	cout << endl;
}