03-树3 Tree Traversals Again (25分)

03-树3 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 <queue>
#include <stack>
#include <cstring>
#include <string>
using namespace std;
const int maxn = 150;
int pre[maxn], in[maxn], out[maxn];
int cnt, res;
void getout(int l1, int l2, int l3, int n)
{
    if (n == 0)
    {
        return;
    }
    else if (n == 1)
    {
        out[l3] = pre[l1];
        return;
    }
    int root = pre[l1];
    out[l3 + n - 1] = root;
    int i = 0;
    while (i < n)
    {
        if (in[i + l2] == root)
            break;
        i++;
    }
    int l = i;
    int r = n - i - 1;
    getout(l1 + 1, l2, l3, l);
    getout(l1 + l + 1, l2 + l + 1, l3 + l, r);
}
int main()
{
    int a, n;
    string s;
    stack<int> st;
    cin >> n;
    for (int i = 0; i < 2 * n; i++)
    {
        cin >> s;
        if (s == "Push")
        {
            cin >> a;
            pre[cnt++] = a;
            st.push(a);
        }
        else
        {
            in[res++] = st.top();
            st.pop();
        }
    }
    getout(0, 0, 0, n);
    int flag = 0;
    for (int i = 0; i < n; i++)
    {
        if (flag)
            cout << " ";
        flag = 1;
        cout << out[i];
    }
    return 0;
}