PAT 甲 1086 Tree Traversals Again

2022.1.28 练习 PAT甲 1086 Tree Traversals Again （原题链接）

已知先序和中序遍历，求后序遍历

题解如下：

#include <bits/stdc++.h>
using namespace std;
int n;

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

stack<int> inorder;
vector<int> pre;
vector<int> in;
vector<int> post;

node* create(int prel,int prer,int inl,int inr)
{
    if(prel>prer)
        return NULL;
    node* root=new node;
    root->data=pre[prel];
    int k;
    for(k=inl;k<=inr;k++)
    {
        if(in[k]==pre[prel])
            break;
    }
    int numleft=k-inl;
    root->lchild=create(prel+1,prel+numleft,inl,k-1);
    root->rchild=create(prel+numleft+1,prer,k+1,inr);
    return root;
}

void postorder(node* root)
{
    if(root==NULL)
        return ;
    postorder(root->lchild);
    postorder(root->rchild);
    post.push_back(root->data);
}
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>n;
    int m=2*n;
    while(m--)
    {
        string tmp;
        cin>>tmp;
        if(tmp=="Push")
        {
            int num;
            cin>>num;
            pre.push_back(num);
            inorder.push(num);

        }
        else if(tmp=="Pop")
        {
            int num=inorder.top();
            in.push_back(num);
            inorder.pop();
        }
    }
    node* root=create(0,n-1,0,n-1);
    postorder(root);
    for(vector<int>::iterator it=post.begin();it!=post.end();it++)
    {
        cout<<*it;
        if(it<post.end()-1)
            cout<<" ";
    }
    return 0;
}