PAT(甲级)1086

1086. Tree Traversals Again (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>

using namespace std;


struct Node{
	Node(int v):value(v),left(NULL),right(NULL){
	}
	int value;
	Node *left;
	Node *right;
};
stack<Node *> snode;

vector<int >ans;

void postorder(Node *start){
	if(start == NULL)
	    return;
	else{
		postorder(start->left);
		postorder(start->right);
		ans.push_back(start->value);
	}
}

void display(){
	int size = ans.size();
	if(size){
		printf("%d",ans[0]);
		for(int i=1;i<size;i++)
		    printf(" %d",ans[i]);
		printf("\n");
	}
}

int main()
{
	int N;
	char s1[8];
	int value;
	bool flag =false;
	Node *root,*cur;
	Node *lastpop = NULL;  //indicate last op is push
//	freopen("test.txt","r",stdin);
	scanf("%d",&N);
	for(int i=0;i<N*2;i++){
		scanf("%s%d",s1,&value);
		if(s1[1] == 'u'){
			cur = new Node(value);
			if(!flag){
				root = cur;
				flag =true;
				snode.push(cur);
				continue;
			}
			if(lastpop == NULL){
				Node *ptmp = snode.top();
				ptmp->left = cur;
			}else{
				lastpop->right = cur;
				lastpop = NULL;
			}
			snode.push(cur);
		}else{
			lastpop = snode.top();
			snode.pop();
//			opflag = false;
		}
	}
	postorder(root);
	display();
	return 0;
}