PAT甲级1120Tree Traversals（后序中序建树）

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

//题意：给你后序，前序，按层次遍历输出

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
struct Node
{
    int num;
    int weight;
    friend bool operator<(const Node &A,const Node &B)
    {
        return A.weight>B.weight;
    }

}node;
priority_queue<Node>q;
void build(int *post,int *in,int len,int w)
{
    if(len<=0)
        return ;
    int index=0;
    while(in[index]!=post[len-1])index++;
    node.num=in[index];
    node.weight=w;
    q.push(node);
    build(post,in,index,w*2);
    build(post+index,in+index+1,len-index-1,w*2+1);
}
int main()
{
    int n;
    scanf("%d",&n);
    int post[40],in[40];
    for(int i=0;i<n;i++)
        scanf("%d",&post[i]);
    for(int i=0;i<n;i++)
        scanf("%d",&in[i]);
    build(post,in,n,1);
    Node temp=q.top();
    printf("%d",temp.num);
    q.pop();
    while(!q.empty())
    {
        temp=q.top();
        printf(" %d",temp.num);
        q.pop();
    }
    printf("\n");
    return 0;
}