PAT菜鸡笔记1119 Pre- and Post-order Traversals

PAT菜鸡笔记1119 Pre- and Post-order Traversals

#include <iostream>
#include<vector>
using namespace std;
int pre[30], post[30];
int n,flag=1;
vector<int> in;
void In(int postroot, int preroot,int end_onpre,int start_onpost)
{
    if (preroot == end_onpre)//无子女
    {
        in.push_back(pre[preroot]);
        return;
    }
    if (pre[preroot] == post[postroot])
    //pre数组和post还在遍历同一颗子树
    {
        int i = preroot;
        while (i <= end_onpre && pre[i] != post[postroot - 1])i++;//找到右子树根节点在pre中的位置
        if (i - preroot > 1)//左子树存在
            In(start_onpost +(i-preroot-1)-1,preroot+1,i-1, start_onpost);//左子树遍历
     //i-preroot-1表示在pre中找到左子树节点数目，
     //start_onpost +(i-preroot-1)-1表示在post中左子树根节点的位置
        else//左子树不存在就不唯一
            flag = 0;
        in.push_back(post[postroot]);
        In(postroot-1,i, end_onpre, start_onpost +(i-preroot)-1);//右子树遍历
    }
}

int main() {
 
    cin >> n;
    for (int i = 0; i < n; i++)
        scanf("%d", &pre[i]);
    for (int i = 0; i < n; i++)
        scanf("%d", &post[i]);
    In(n - 1,0,n-1,0);
    printf("%s\n%d", flag == 1 ? "Yes" : "No", in[0]);
    for (int i = 1; i < in.size(); i++)
        printf(" %d", in[i]);
    printf("\n");
    return 0;
}