PATA1020题解

利用后序遍历和中序遍历建树，输出层序遍历

//
//  main.cpp
//  PATA1020
//
//  Created by Phoenix on 2018/2/7.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;

const int maxn = 40;
int n, post[maxn], in[maxn];

struct node {
    int data;
    node *lchild, *rchild;
};

node* newnode(int x){
    node* root = new node;
    root->data = x;
    root->lchild = root->rchild = NULL;
    return root;
}

node* create(int postL, int postR, int inL, int inR) {
    if(postL > postR) return NULL;
    node* root = newnode(post[postR]);
    int i;
    for(i = inL; i <= inR; i++) {
        if(in[i] == post[postR])
            break;
    }
    root->lchild = create(postL, postL + i - inL - 1, inL, i - 1);
    root->rchild = create(postL + i - inL, postR - 1, i + 1, inR);
    return root;
}

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

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