PAT.A1086 Tree Traversals Again

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<string>
#include<stack>
using namespace std;
struct node {
	int data;
	node* lchild;
	node* rchild;
};
const int maxn = 35;
int pre[maxn];
int in[maxn];
int n,mm=0;
node* create(int prel, int prer, int inl, int inr) {
	if (prel > prer) return NULL;
	node* root = new node;
	root->data = pre[prel];
	int k;
	for (k = inl; k <= inr; k++) {
		if (pre[prel] == in[k]) break;
	}
	int num = k - inl;
	root->lchild = create(prel+1,prel+num,inl,k-1);
	root->rchild = create(prel + num + 1, prer, k + 1, inr);
	return root;
}
void pos(node* root) {
	if (root == NULL) return;
	pos(root->lchild);
	pos(root->rchild);
	printf("%d", root->data);
	mm++;
	if (mm < n) printf(" ");
}
int main() {
	scanf("%d", &n);
	cin.get();
	stack<int> q;
	int t1 = 0, t2 = 0;
	for (int i = 0; i < 2 * n; i++) {
		string str;
		getline(cin, str);
		if (str.substr(0, 3) == "Pus") {
			int t;
			if (str.size() == 6) {
				t = str[5] - '0';
			}
			else {
				t = (str[5] - '0') * 10 + (str[6] - '0');
			}
			pre[t1++] = t;
			q.push(t);
			
		}
		else {
			in[t2++] = q.top();
			q.pop();
		}
	}
	node* root = create(0, n - 1, 0, n - 1);
	pos(root);
	
	return 0;
}