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<bits/stdc++.h>
using namespace std;
typedef struct node
{
    int data;
    struct node *lchild,*rchild;
}node,*Tree;

int post[101],in[101],n,num=0;

Tree Create(int postl,int postr,int inl,int inr)
{
    if(postl>postr)
        return NULL;
    Tree root = new node;
    root->data = post[postr];
    int k;
    for(k=inl;k<=inr;k++)
        if(in[k]==post[postr])
            break;
    int leftnum = k-inl;
    root->lchild = Create(postl,postl+leftnum-1,inl,k-1);
    root->rchild = Create(postl+leftnum,postr-1,k+1,inr);
    return root;
}

void bfs(Tree root)
{
    queue<Tree>q;
    q.push(root);
    while(!q.empty())
    {
        Tree t= q.front();
        q.pop();
        cout<<t->data;
        num++;
        if(t->lchild)
            q.push(t->lchild);
        if(t->rchild)
            q.push(t->rchild);
        if(num<n)
            cout<<" ";
    }
}

int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>post[i];
    for(int i=0;i<n;i++)
        cin>>in[i];
    Tree root;
    root = Create(0,n-1,0,n-1);
    bfs(root);
}