PAT1020. Tree Traversals (25)（已知中序后序求层序）

1020. Tree Traversals (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<iostream>
#include<algorithm>
#include<string>
#include<queue>

using namespace std;

struct tree
{
    int data;
    tree *l, *r;
};

tree *create_tree(int n, int *a, int *b)
{
    tree *root;
    if(!n)
        return NULL;
    root = new tree;
    root->data = a[n-1];
    int t;
    for(int i=0;i<n;++i)
        if(b[i] == root->data)
        {
            t = i;
            break;
        }
    root->l = create_tree(t, a, b);
    root->r = create_tree(n-t-1, a+t, b+t+1);
    return root;
}

void level_order(tree *root)
{
    queue <int> que;
    tree *p[1010];
    int rear=0, frot=0;
    if(root)
    {
        que.push(root->data);
        p[rear++]=root;
    }
    while(rear>frot)
    {
        root=p[frot++];
        if(root->l)
        {
            que.push(root->l->data);
            p[rear++]=root->l;
        }
        if(root->r)
        {
            que.push(root->r->data);
            p[rear++]=root->r;
        }
    }
    while(!que.empty())
    {
        que.size() == 1?cout<<que.front()<<endl:cout<<que.front()<<" ";
        que.pop();
    }
}

int main()
{
    ios::sync_with_stdio(false);
    int n;
    while(cin>>n)
    {
        int *a = new int [n];
        int *b = new int [n];
        for(int i=0;i<n;++i)
            cin>>a[i];
        for(int i=0;i<n;++i)
            cin>>b[i];
        tree *root;
        root = create_tree(n, a, b);
        level_order(root);

    }
    return 0;
}