PAT甲级 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 <bits/stdc++.h>
using namespace std;
struct node
{
    int key;
    node *left,*right;
    node(int val):key(val),left(NULL),right(NULL){}
};
int n,cnt=0;
vector<int> inorder,preorder;
stack<int> st;
node *create(int preleft,int preright,int inleft,int inright)
{
    if(preleft>preright||inleft>inright) return NULL;
    node  *root=new node(preorder[preleft]);
    for(int i=inleft;i<=inright;i++)
    {
        if(inorder[i]==preorder[preleft])
        {
            root->left=create(preleft+1,preleft+i-inleft,inleft,i-1);
            root->right=create(preleft+i-inleft+1,preright,i+1,inright);
            break;
        }
    }
    return root;
}
void postorder(node *root)
{
    if(!root) return;
    postorder(root->left);
    postorder(root->right);
    cnt++;
    printf("%d",root->key);
    if(cnt<n) printf(" ");
}
int main()
{
    scanf("%d",&n);
    for(int i=0;i<2*n;i++)
    {
        string str;
        cin>>str;
        if(str=="Push")
        {
            int temp;
            scanf("%d",&temp);
            st.push(temp);
            preorder.push_back(temp);
        }
        else
        {
            inorder.push_back(st.top());
            st.pop();
        }
    }
    postorder(create(0,preorder.size()-1,0,inorder.size()-1));
    return 0;
}