1020 Tree Traversals——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

 solution：
 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int in[35];
int post[35];
typedef struct node *tree;
struct node
{
    int data;
    tree l=NULL,r=NULL;
};
/*
void preorder(tree t)
{
	if(t==NULL)return;
	cout<<t->data<<' ';
	preorder(t->l);
	preorder(t->r);
}
*/
void levelorder(tree t)
{
	if(t==NULL)return;
	int cnt=0;
	queue<tree>q;
	tree p=t;
	q.push(p);
	while(!q.empty())
	{
		if(cnt)cout<<' ';
		cout<<q.front()->data;
		cnt++;
		if(q.front()->l!=NULL)q.push(q.front()->l);
		if(q.front()->r!=NULL)q.push(q.front()->r);
		q.pop();
	}
	return;
}
tree build(int post[],int in[],int n)
{
    tree t;
    if(!n)return NULL;
    t=new node;
    //t=(tree)malloc(sizeof(struct node));
    t->data=post[0];
    t->l=t->r=NULL;
    int i;
    for(i=0;i<n;i++)
    {
    	if(post[0]==in[i])break;
	}
	t->l=build(post+n-i,in,i);
	t->r=build(post+1,in+1+i,n-i-1);
	return t;
}
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];
    }
    reverse(post,post+n);
    tree t=build(post,in,n);
    levelorder(t);
    //preorder(t);
    return 0;
}

 参考：pta--玩转二叉树_玩转二叉树pta-CSDN博客

         大致思路是，光根据中序和后序遍历写出二叉树可能有点困难，但是后序遍历是左右根，如果将后续遍历reverse以下，那么就变成了根右左，一个中心对称的先序遍历。以此和中序遍历为依据写出的build函数，三个参数分别是，后序(逆转)数组，中序数组，根节点下标(即对于下一轮递归而言数组的范围)。得出二叉树后直接层序输出即可。