PAT A1086. 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 <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
const int Max = 40;
int n;
int pre[Max],in[Max];
int Pre=0,In=0;
struct Node
{
	int data;
	Node* rchild;
	Node* lchild;
};
stack<int> S;
stack<Node*> s;
queue<Node*> Q;
Node* creat(int PreL,int PreR,int InL,int InR)
{
	if(PreL>PreR) return NULL ;
	Node* root = new Node;
	int k;
	for(int i=InL;i<=InR;i++)
	{
		if(in[i]==pre[PreL])
		{	
			k=i;
			break;
		}
	}
	root->data=pre[PreL];
	int leftnum = k-InL;
	root->lchild=creat(PreL+1,PreL+leftnum,InL,InL+leftnum-1);
	root->rchild=creat(PreL+leftnum+1,PreR,InL+leftnum+1,InR);
	return root;
}
void Post(Node * root)
{
	if(root==NULL)
		return;
	Post(root->lchild);
	Post(root->rchild);
	printf("%d",root->data);
	if(root->data!=pre[0])
		printf(" ");
}
int main()
	{
		
		scanf("%d",&n);
		int ans;
		int flag;
		int temp=2*n;
		char judge[10];
		while(!S.empty())
		{
			S.pop();
		}
	    while(temp>0)
		{
			scanf("%s",judge);
			if(judge[1]=='u')
			{
				scanf("%d",&ans);
				pre[Pre++]=ans;
				S.push(ans);
				temp--;
			}
			else 
			{
				in[In++]=S.top();
				S.pop();
				temp--;
			}
		}
		Node* root = creat(0,n-1,0,n-1);
		Post(root);
		system("pause");
		return 0;
	}