1086 Tree Traversals Again（25 分）

最新推荐文章于 2021-02-26 14:07:35 发布

galesaur_wcy

最新推荐文章于 2021-02-26 14:07:35 发布

阅读量548

点赞数

分类专栏： PAT甲级题

本文链接：https://blog.csdn.net/galesaur_wcy/article/details/82021050

版权

PAT甲级题专栏收录该内容

145 篇文章 3 订阅

订阅专栏

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

题目好了理解了好一会看着样例才知道意思

push进去的东西是先序
而pop出来的东西是中序
以此建立一颗树然后输出后序排序

hhhh姐姐我再也不怕先序中序建树和后序中序建树了so easy

代码:

#include<bits/stdc++.h>
using namespace std;
vector<int>post,pre,in;
int n,x;
struct node
{
	int data;
	node *left,*right;
};
void postOrder(node * root)
{
	if(root)
	{
		postOrder(root->left);
		postOrder(root->right);
		post.push_back(root->data);
	}
	return ;
}  
node* buildTree(vector<int>pre,vector<int>in, int pl, int pr,int il,int ir)
{
	if(pl > pr || il > ir) 
		return NULL;
	int pos;
	for(int i =il; i <= ir; i++)
	{
		if(pre[pl] == in[i])
		{
			pos = i;
			break; 
		} 
	}
	node * root= new node();
	root->data = pre[pl];
	root->left = root->right = NULL; 
	root->left = buildTree(pre,in,pl+1,pl+pos-il,il,pos-1);
	root->right = buildTree(pre,in,pl+pos-il+1,pr,pos+1,ir);
	return root;
}
int main()
{
	stack<int>st;
	scanf("%d",&n);
	char str[10];
	pre.push_back(-1);
	in.push_back(-1); 
	for(int i = 1; i <= n*2; i++ )
	{
		scanf("%s",str);
		if(strcmp(str,"Push") == 0)
		{
			scanf("%d",&x);
			st.push(x);
			pre.push_back(x);
		}else 
		{
			x = st.top();
			st.pop();
			in.push_back(x);
		}
	}
	node *root;
	root = buildTree(pre,in,1,n,1,n);
	postOrder(root);
	for(int i = 0 ; i< n; i++)
		printf("%d%c",post[i]," \n"[i==n-1]);
	return 0;
}