1086 Tree Traversals Again（25 分）（C++）

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 <vector>
#include <stack>
using namespace std;
vector<int>pre, in;
int n, temp, cur = 0;
void posttravel(int preleft, int inleft, int inright){
	if(inleft > inright)
		return;
	int i = inleft;
	while(in[i] != pre[preleft])  ++ i;
	posttravel(preleft + 1, inleft, i - 1);
	posttravel(preleft + i - inleft + 1, i + 1, inright);
	if(cur != 0)
		printf(" ");
	++ cur;
	printf("%d", pre[preleft]);
		
}
int main(){
	stack<int>s;
	scanf("%d\n", &n);
	for(int i = 0; i < 2 * n; ++ i){
		char op[5];
		scanf("%s", op);
		if(op[1] == 'u'){
			scanf("%d", &temp);
			s.push(temp);
			pre.push_back(temp);
		}
		else{
			temp = s.top();
			s.pop();
			in.push_back(temp);
		}
	}
	posttravel(0, 0, n - 1);
}