PATA1127题解

通过中序遍历和后序遍历构造二叉树，再通过层序遍历，奇数行输出逆序，偶数行输出顺序，利用栈来存储

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

#include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
using namespace std;
int n, post[40], in[40];

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

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

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