PAT-甲级-1086 Tree Traversals Again (25 分)

1086 Tree Traversals Again (25 分)
 

An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.

Figure 1

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤30) which is the total number of nodes in a tree (and hence the nodes are numbered from 1 to N). Then 2N lines follow, each describes a stack operation in the format: "Push X" where X is the index of the node being pushed onto the stack; or "Pop" meaning to pop one node from the stack.

Output Specification:

For each test case, print the postorder traversal sequence of the corresponding tree in one line. A solution is guaranteed to exist. All the numbers must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:

6
Push 1
Push 2
Push 3
Pop
Pop
Push 4
Pop
Pop
Push 5
Push 6
Pop
Pop

Sample Output:

3 4 2 6 5 1

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j,k)    for(int i=j;i<k;i++)

vector<int> in,pre,ans;
void dfs(int root,int inL,int inR){
    if(inL > inR)    return;
    int i = inL;
    while(i<inR && in[i] != pre[root])    i++;
    dfs(root+1,inL,i-1);
    dfs(root+i+1-inL,i+1,inR);
    ans.push_back(pre[root]);
}
int main(){
    std::ios::sync_with_stdio(false);
    int n,b;
    cin>>n;
    stack<int> st;
    string a;
    rep(i,0,2*n){
        cin>>a;
        if(a.size()==3){
            in.push_back(st.top());
            st.pop();
        }else{
            cin>>b;
            pre.push_back(b);
            st.push(b);
        }
    }
    dfs(0,0,n-1);
    rep(i,0,n){
        if(i!=0)cout<<" ";
        cout<<ans[i];
    }
    return 0;
}