1086 Tree Traversals Again (25 分)

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.

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;
vector<int> in, pre, post;
unordered_map<int, int> pos;
void Post(int inL, int inR, int preRoot) {
	if (inL > inR) return;
	int inRoot = pos[pre[preRoot]];
	Post(inL, inRoot - 1, preRoot + 1);
	Post(inRoot + 1, inR, preRoot + inRoot - inL + 1);
	post.push_back(pre[preRoot]);
}
int main() {
	int n, num;
	scanf("%d", &n);
	string s;
	stack<int> st;
	for (int i = 0; i < n * 2; i++) {
		cin >> s;
		if (s[2] == 's') {
			cin >> num;
			pre.push_back(num);
			st.push(num); 
		} else if (s[2] == 'p') {
			in.push_back(st.top());
			pos[st.top()] = in.size() - 1;
			st.pop();
		}
	}
	Post(0, n - 1, 0);
	for (int i = 0; i < n; i++) {
		if (i != 0) printf(" ");
		printf("%d", post[i]);
	}
}