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 <stack>
using namespace std;
const int N=40;
int n;
int l[N],r[N];
void postorder(int u,int root){
    if(!u) return;
    postorder(l[u],root);
    if(r[u])    postorder(r[u],root);
    cout<<u;
    if(u!=root) cout<<' ';
}
int main(){
    cin>>n;
    int last=0,type;
    int root=0;
    stack <int>stk;
    for(int i=0;i<(n<<1);i=-~i){
        string op;cin>>op;
        if(op=="Push"){
            int x;cin>>x;
            if(!last)   root=x;//第一个
            else{//不是第一个
                if(type==1) l[last]=x;//上一个是push
                else r[last]=x;
            }
            stk.push(x);last=x;type=1;
        }else{//pop 
            last=stk.top();
            stk.pop();
            type=0;
        }//if 
    }//for 
    postorder(root,root);
    return 0;
}

PAT目录