【PAT】1086 Tree Traversals Again（C++）

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.

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.

#include "bits/stdc++.h"
using namespace std;

struct Node{
	int data;
	Node *left;
	Node *right;
};

int n;
int pre_order[35];
int in_order[35];
stack<int> sk;

Node *createTree(int pre_l,int pre_r,int in_l,int in_r){
	if(pre_l>pre_r){
		return NULL;
	}
	Node *node=new Node;
	node->data=pre_order[pre_l];
	int k;
	for(k=in_l;k<=in_r;k++){
		if(in_order[k]==pre_order[pre_l]){
			break;
		}
	}
	
	
	node->left=createTree(pre_l+1,pre_l+k-in_l,in_l,k-1);
	node->right=createTree(pre_l+k-in_l+1,pre_r,k+1,in_r);
	return node;
}

void postOrder(Node *root,int &cnt){
	if(root==NULL)
		return;
	postOrder(root->left,cnt);
	postOrder(root->right,cnt);
	if(cnt<n-1){
		cout<<root->data<<" ";
		cnt++;
	}else{
		cout<<root->data;
		cnt++;
	}
}

int main(){
	
	cin>>n;
	getchar();
	string op;
	int p=0,q=0;
	for(int i=0;i<2*n;i++){
		getline(cin,op);
		if(op.size()>3){
			int data=stoi(op.substr(5));
			sk.push(data);
			pre_order[p++]=data;
		}else{
			int data=sk.top();
			sk.pop();
			in_order[q++]=data;
		}
	}
	
	Node *root=root=createTree(0,p-1,0,q-1);
	int cnt=0;
	postOrder(root,cnt);
}