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$ ($\le 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 <stdio.h>
#include <queue>
#include <string>
#include <string.h>
#include <stack>
#define N 30
///1440-1626

using namespace std;


int main()
{
    int i,n,t,tree[N+1][2],state=1,prTop=0,head,rt,lf,top;
    int visit[N+1]= {0};

    string StrIn="Push";
    string StrOt="Pop";
    string StrOp;
    stack<int >stTree;
    memset(tree,-1,sizeof(tree));

    cin>>n;
    for (i=1; i<=n*2; i++)
    {
        cin>>StrOp;
        if (StrOp==StrOt)
        {
            prTop=stTree.top();
            stTree.pop();
            state=0;
        }
        else
        {
            cin>>t;
            head= (i==1)?t:head;
            if (state==1&&(!stTree.empty()))
            {
                prTop=stTree.top();
            }
            stTree.push(t);
            if (state==1)
            {

                tree[prTop][0]=t;
            }
            else
            {
                tree[prTop][1]=t;
                state=1;
            }
        }
    }

    while(!stTree.empty())
    {
        stTree.pop();
    }
    stTree.push(head);
    visit[head]=1;
    while(!stTree.empty())
    {
        top = stTree.top();
        visit[top]=1;

        lf = tree[top][0];
        rt = tree[top][1];

        if ((rt!=-1&&!visit[rt])||(lf!=-1&&!visit[lf]))
        {
            if (rt!=-1&&!visit[rt])
            {
                stTree.push(rt);
            }
            if (lf!=-1&&!visit[lf])
            {
                stTree.push(lf);
            }
        }
        else
        {
            cout<<top;
            stTree.pop();
            if (stTree.empty())
            {
                cout<<endl;
            }
            else
            {
                cout<<" ";
            }

        }


    }

    return 0;
}