PAT 甲级 A1086

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

输入格式

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.

输出格式

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

总结

1. 题意是用栈模拟一个二叉树的中序序列，给出出栈入栈的操作，让你写出这个栈的后续序列
2. 刚开始看得挺蒙，后来观察发现，这个入栈序列刚好对应了二叉树的先序遍历，出栈序列对应了二叉树的中序遍历。有了先序遍历和后序遍历的结果，就可以唯一确定出一棵唯一的二叉树了。
3. 开始测试点4过不去，原因是入栈的时候我用字符串的最后一位-'0’来得到int类型的入栈元素。刚开始没想到两位数就不能用这个方法了- -||，这个点卡了我半天…太粗心了我

AC代码

#include <iostream>
#include<cstring>
#include<stack>
using namespace std;
int n, pre[35], in[35];
struct node
{
	int val;
	node*left, *right;
};
node*createBiTree(int preL,int preR,int inL,int inR) {
	if (preL > preR) return nullptr;   //递归出口
	node*root = new node;
	root->val = pre[preL];   //根节点的值
	int k = inL;
	while (in[k] != root->val && k < inR)k++;

	int numL = k - inL;
	root->left = createBiTree(preL + 1, preL + numL, inL, k - 1);
	root->right = createBiTree(preL + numL + 1, preR, k + 1, inR);
	return root;
}
void showPostTraversal(node*root,int&index) {
	if (root) {
		showPostTraversal(root->left, index);
		showPostTraversal(root->right, index);
		index++;
		printf("%d", root->val);
		if (index < n) printf(" ");
	}
}
int main() {
	int preR = 0, inR = 0;
	stack<int> s;
	scanf("%d", &n);
	getchar();
	for (int i = 0; i < 2*n; i++) {
		char temp[5];
		scanf("%s", temp);
		if (strcmp(temp,"Push")==0) {  //注意不要用 字符-'0'的方式得到int型数字,如果数字超过10,这个方式就不行了
			int val;
			scanf("%d", &val);
			s.push(val);          //进栈为先序
			pre[preR++] = val;
		}
		else { //出栈为中序
			in[inR++] = s.top();
			s.pop();
		}
	}
	int index = 0;
	showPostTraversal(createBiTree(0, n - 1, 0, n - 1), index);
	return 0;
}