1020 Tree Traversals (25)（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 <iostream>
#include <queue>

using namespace std;

int n;
int porder[33],inorder[33];

struct node
{
    int data;
    node *left,*right;
};

struct node *create(int len,int porder[],int inorder[])
{
    if(len < 1)
        return NULL;
    node *root = new node;
    root->data = porder[len-1];
    int i;
    for (i = 0; i < len; ++i)
    {
        if(inorder[i] == porder[len-1])
            break;
    }
    root->left = create(i,porder,inorder);
    root->right = create(len-i-1,porder+i,inorder+i+1);
    return root;
}

void show(node *root)
{
    if(!root)
        return ;
    queue<node *>q;
    q.push(root);
    int flag = 1;
    while(!q.empty())
    {
        node *t = q.front();
        if(flag){
            cout<<t->data;
            flag = 0;
        }
        else
            cout<<' '<<t->data;
        q.pop();
        if(t->left)
            q.push(t->left);
        if(t->right)
            q.push(t->right);
    }
}
int main(int argc, char const *argv[])
{
    cin>>n;
    for (int i = 0; i < n; ++i)
    {
        cin>>porder[i];
    }   
    for (int i = 0; i < n; ++i)
    {
        cin>>inorder[i];
    }
    node *root = create(n,porder,inorder);
    show(root);
    return 0;
}