PAT A1086：Tree Traversals Again之前序和中序遍历建树&栈模拟建树过程

题目描述

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

求解思路

用栈模拟得到树的前序和中序序列，最后得到树的后序遍历序列。

代码实现(AC)

#include<cstdio>
#include<stack>
using namespace std;
struct Node{
	int data;
	Node *lchild;
	Node *rchild;
};
int n,inindex=0,preindex=0,cnt=0;
int in[40],pre[40];
stack<int>s;
Node *create(int preL,int preR,int inL,int inR)
{
	if(preL>preR)	return NULL;
	Node *root=new Node;
	root->data=pre[preL];
	int i=inL;
	for(;i<=inR;i++)
		if(in[i]==pre[preL])	break;
	root->lchild=create(preL+1,preL+(i-inL),inL,i-1);
	root->rchild=create(preL+(i-inL)+1,preR,i+1,inR);
	return root; 
}
void postorder(Node *root)
{
	if(root==NULL)	return;
	postorder(root->lchild);
	postorder(root->rchild);
	printf("%d",root->data);
	if(++cnt!=n)	printf(" ");
}
void solve()
{
	scanf("%d",&n);
	char str[5];
	int tmp;
	for(int i=0;i<2*n;i++)
	{
		scanf("%s",str);
		if(str[1]=='u')
		{
			scanf("%d",&tmp);
			s.push(tmp);
			pre[preindex++]=tmp;
		}	
		else
		{
			in[inindex++]=s.top();
			s.pop();	
		}
	}	
	Node *root=create(0,n-1,0,n-1);
	postorder(root); 
}
int main()
{
	solve();
	return 0;
}