pat 甲级 树 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.

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

题意： 用栈的形式给出一棵二叉树的建立的顺序，求这棵二叉树的后序遍历。

分析：入栈顺序为前序序列pre，出栈顺序为中序序列in，已知前序和中序求后序。

#include<iostream>
#include<stack>
#include<vector>
using namespace std;
stack<int> st;
vector<int> pre,in;
void postOrder(int root,int inl,int inr){
	if(inl>inr) return;
	int i=0;
	while(in[i]!=pre[root]) i++;//找中序根结点下标
	postOrder(root+1,inl,i-1);
	postOrder(root+1+i-inl,i+1,inr);
	printf("%d%s",pre[root],root==0?"\n":" "); 
} 
int main(){
	int n,index;
	string s;
	cin>>n;
	for(int i=0;i<2*n;i++){
		cin>>s;
		if(s=="Push"){
			scanf("%d",&index);
			pre.push_back(index);
			st.push(index);
		}
		else{
			in.push_back(st.top());//取栈顶元素 
			st.pop(); //出栈
		}
	}
	postOrder(0,0,n-1);
	return 0;
	
}