【笨方法学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

二、题目大意

前序、中序转后序。

三、考点

树、DFS

四、注意

1、模拟栈，确定前序、中序；

2、建树；

3、DFS。

五、代码

#include<iostream>
#include<vector>
#include<string>
#include<stack>
using namespace std;
vector<int> post, in, pre;
vector<bool> visit;
struct node {
	int val;
	node *left, *right;
};
node* buildTree(int prel, int prer, int inl, int inr) {
	if (inl > inr)
		return NULL;
	int pos;
	for (pos = inl; pos <= inr; ++pos) {
		if (in[pos] == pre[prel])
			break;
	}
	node *root = new node;
	root->val = in[pos];
	root->left = buildTree(prel + 1, prel+1+pos-1-inl, inl, pos - 1);
	root->right = buildTree(prer-(inr-pos-1), prer, pos + 1, inr);
	return root;
}
void dfs(node *root) {
	if (root == NULL)
		return;
	dfs(root->left);
	dfs(root->right);
	post.push_back(root->val);
}
int main() {
	//read
	int n;
	cin >> n;
	stack<int> sta;
	for (int i = 0; i < 2 * n; ++i) {
		string s;
		cin >> s;
		//push
		if (s[1] == 'u') {
			int a;
			cin >> a;
			pre.push_back(a);
			sta.push(a);
		}
		//pop
		else {
			in.push_back(sta.top());
			sta.pop();
		}
	}

	//buildtree
	node* root = buildTree(0, n - 1, 0, n - 1);

	//dfs
	dfs(root);

	//output
	for (int i = 0; i < n; ++i) {
		if (i != 0)
			cout << " ";
		cout << post[i];
	}

	system("pause");
	return 0;
}