PAT-1020 Tree 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 <bits/stdc++.h>

using namespace std;
const int maxn = 30;
int n;
struct node{
    char data;
    node* lchild;
    node* rchild;
}BiTree;
int post[maxn], in[maxn];

/*重建*/
node* restore(int postL, int postR, int inL, int inR){
    if(postL>postR)
        return NULL;
    node* root = new node;
    root->data = post[postR];
    int k;
    for(k=inL; k<=inR; k++){
        if(in[k]==post[postR])
            break;
    }
    int numLeft = k - inL;
    root->lchild = restore(postL, postL+numLeft-1, inL, k-1);
    root->rchild = restore(postL+numLeft, postR-1, k+1, inR);
    return root;
}

/*层次*/
int num = 0;
void levelorder(node* root){
    queue<node*> Q;
    Q.push(root);
    while(!Q.empty()){
        node *top = Q.front();
        Q.pop();
        printf("%d", top->data);
        num++;
        if(num<n) printf(" ");
        if(top->lchild!=NULL)
            Q.push(top->lchild);
        if(top->rchild!=NULL)
            Q.push(top->rchild);
    }
}


int main(){
    scanf("%d", &n);
    for(int i=0; i<n; i++)
        scanf("%d", &post[i]);
    for(int j=0; j<n; j++)
        scanf("%d", &in[j]);
    node* root = restore(0, n-1, 0, n-1);
    levelorder(root);
	return 0;
}