【PAT】1086. Tree Traversals Again

最新推荐文章于 2020-04-15 18:53:23 发布

永远的EMT

最新推荐文章于 2020-04-15 18:53:23 发布

阅读量278

点赞数

分类专栏：二叉树 PAT解题报告

本文链接：https://blog.csdn.net/KID_LWC/article/details/54993018

版权

PAT解题报告同时被 2 个专栏收录

117 篇文章 1 订阅

订阅专栏

二叉树

15 篇文章 0 订阅

订阅专栏

考查点：二叉树重建，后序遍历

#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 10005
#define oo 0x3f3f3f3f
using namespace std;

const int maxn=50;
struct node{
    int data;
    node* lchild;
    node* rchild;
};
int pre[maxn],in[maxn],post[maxn];
int n;
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;
}
int num;
void postorder(node* root){
    if(root==NULL) return ;
    postorder(root->lchild);
    postorder(root->rchild);
    printf("%d",root->data);
    num++;
    if(num<n)printf(" ");
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL
    scanf("%d",&n);
    stack<int> st;
    int x;
    int preL=0,preR=0,inL=0,inR=0;
    FOR(i,0,2*n){
        char str[5];
        scanf("%s",str);
        if(strcmp(str,"Push")==0){
            scanf("%d",&x);
            st.push(x);
            pre[preR++]=x;
        }else{
            in[inR++]=st.top();
            st.pop();
        }
    }

    node* root=create(0,n-1,0,n-1);
    postorder(root);
    return 0;
}