PAT Tree Traversals Again (25)

Tree Traversals Again (25)

时间限制 1000 ms  内存限制 65536 KB  代码长度限制 100 KB  判断程序 Standard  (来自 小小)

题目描述

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.

输入例子:

6
Push 1
Push 2
Push 3
Pop
Pop
Push 4
Pop
Pop
Push 5
Push 6
Pop
Pop

输出例子:

3 4 2 6 5 1

中序遍历入栈的顺序是先序遍历

出栈的顺序是中序遍历

因此不难计算出树形

这道题目最坑的地方是题目里面明明说node上的值是索引，但其实依照测试数据来看明明是值啊

// pat.cpp : 定义控制台应用程序的入口点。
//


// pat.cpp : 定义控制台应用程序的入口点。
//

//#include "stdafx.h"
#include"stdio.h"
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<math.h>
using namespace std;
int n;
char s[5];
stack<int> st;
struct node{
	int d;
int l,r;

}no[50];
int num;
int r;
int pre[50];
int p=0;
int in[50];
int i=0;

int root(int l1,int r1,int l2,int r2){
	
	if(l1>r1||l2>r2)return -1;
	int j;
		for( j=l2;j<=r2;j++)
		{if(in[j]==pre[l1]){
	no[pre[l1]].l=root(l1+1,j-l2+l1,l2,j-1);
	no[pre[l1]].r=root(j-l2+l1+1,r1,j+1,r2);
	break;}}return pre[l1];


}
vector<int>ans;
void postorder(int g){
	if(no[g].l!=-1)postorder(no[g].l);
	
	if(no[g].r!=-1)postorder(no[g].r);
	ans.push_back(g);


}



int main(){
//	freopen("c://jin.txt","r",stdin);
	cin>>n;

	while(scanf("%s",s)!=EOF){
		if(strcmp(s,"Push")==0){
		cin>>num;
		st.push(p);
		no[p].d=num;
		pre[p]=p;
		p++;
		
				}
		else{
			in[i++]=st.top();
			st.pop();
		}}

	   r=root(0,p-1,0,i-1);
	  postorder(r);
	   for(int i=0;i<ans.size();i++){
		   cout<<no[ans[i]].d;
		   if(i!=ans.size()-1)cout<<" ";

	   }




//	freopen("CON","r",stdin);
//	system("pause");

	return 0;
}