1086 Tree Traversals Again

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 <iostream>
#include <stack>
#include <vector>
#include <string> 
using namespace std;

typedef struct node{
	int data;
	node *lchild, *rchild;
}*BTree, BNode;
vector<int> pre, in;

//通过中序序列和先序序列建树 
BTree create(int l1, int h1, int l2, int h2){
	//先序序列为l1,h1], 中序序列为[l2,h2]
	if(l1 > h1)	return NULL;
	BNode* BT = new node;
	BT->data = pre[l1];
	int k = l2;
	while(in[k] != BT->data) k++;
	int num = k - l2;
	BT->lchild = create(l1+1, l1+num, l2, k-1);
	BT->rchild = create(l1+num+1, h1, k+1, h2);
	return BT; 
}

//后序遍历
int cnt = 0;
void postorder(BTree &BT){
	if(BT == NULL) return;
	postorder(BT->lchild);
	postorder(BT->rchild);
	cnt++;
	if(cnt != 1) cout<<" ";
	cout<<BT->data;
} 

int main(){ 
	int n, num;
	string opr;
	stack<int> s;
	cin>>n;
	for(int i = 0; i < 2 * n; i++){
		cin>>opr;
		if(opr == "Push"){
			cin>>num;
			pre.push_back(num);
			s.push(num);
		}
		else{
			in.push_back(s.top());
			s.pop();
		}
	}
	BTree BT = create(0, n - 1, 0, n - 1);
	postorder(BT);
	return 0;
}