PAT甲级- 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

作者: CHEN, Yue

单位: 浙江大学

时间限制: 400 ms

内存限制: 64 MB

使用栈来模拟后序序列的遍历过程，push的顺序就是先序序列，pop的顺序是中序序列 

build（preL, preR, inL, inR）

终止条件preL > preR

找到in序列中preL的位置k，左右子树就划分出来了。

左子树(preL + 1, preL + k - inL, inL, k -1 )

右子树(preL + k - inL + 1, preR, k + 1, inR)

PostOrder的终止条件

root == NULL

// push 是先序序列
// pop 是后序序列

#include<cstdio>
#include<stack>
#include<cstring>
#include<vector>
using namespace std;

const int maxn = 50;
int pre[maxn], in[maxn], post[maxn];

int n;
struct node {
	int data;
	node* lchild;
	node* rchild;
};

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 (in[k] == pre[preL]) {
			break;
		}
	}
	int numLeft = k - inL;

	root->lchild = create(preL + 1, preL + numLeft, inL, k - 1);
	root->rchild = create(preL + numLeft + 1, preR, k + 1, inR);

	return root;
}

int num = 0; //已输出的结点个数
void PostOrder(node* root) {
	if (root == NULL)
		return;
	PostOrder(root->lchild);
	PostOrder(root->rchild);
	printf("%d", root->data);
	num++;
	if (num < n)
		printf(" ");
}

int main() {
	scanf("%d", &n);
	char cmd[15];
	stack<int> st;
	int x, preIndex = 0, inIndex = 0;
	for (int i = 0; i < 2 * n; i++) { //入栈出栈操作要2n次
		scanf("%s", cmd);
		if (strcmp(cmd, "Push") == 0) {
			scanf("%d", &x);
			pre[preIndex++] = x;
			st.push(x);
		}
		else {
			in[inIndex++] = st.top();
			st.pop();
		}
	}
	node* root = create(0, n - 1, 0, n - 1);
	PostOrder(root);
	return 0;
}