【PAT】1119. Pre- and Post-order Traversals

考查点：二叉树的遍历

思路及提交情况：第一次各种格式错误和错误，格式错误居然是最后要换行。。第一次是判断是否唯一时i——后序遍历中第一个等于先序序列左子树根节点的点位置应该在后续序列的左边界前因为本来就是i==postR-1的，如果越界了应该排除，此题思路就是先序遍历的思路重建二叉树，关键在于维护各个序列的边界值

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 10010
#define oo 0x3f3f3f3f
using namespace std;
const int N=40;
int pre[N];
int post[N];

struct node
{
    node* lch;
    node* rch;
    int data;
};

bool flag;
node* Create(int preL,int preR,int postL,int postR)
{
    if(preL>preR)return NULL;
    if(postL>postR)return NULL;
    node* root=new node;
    root->lch=root->rch=NULL;
    root->data=pre[preL];
    int i;
    for(i=postR-1;i>=postL;i--)
    {
        if(pre[preL+1]==post[i]){
            break;
        }
    }

    int numleft=i-postL;
    if(i==postR-1&&postR-1>=postL){
        flag=true;
    }
    root->lch=Create(preL+1,preL+1+numleft,postL,i);
    root->rch=Create(preL+2+numleft,preR,i+1,postR-1);
    return root;
}
int n;
int num;
void DFS(node* root)
{
    if(root==NULL) return;
    DFS(root->lch);

    printf("%d",root->data);
    if(num<n-1)printf(" ");
    num++;
    DFS(root->rch);
}
int main()
{
     #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    scanf("%d",&n);
    FOR(i,0,n-1)
    {
        scanf("%d",&pre[i]);
    }
    FOR(i,0,n-1)
    {
        scanf("%d",&post[i]);
    }


    node* root=Create(0,n-1,0,n-1);
    if(flag==true)printf("No\n");
    else printf("Yes\n");
    DFS(root);
    printf("\n");
    return 0;
}