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 <string>
#include "stdlib.h"
#include <stack>
#include <vector>
using namespace std;
void convert(vector<int> &pre, vector<int> &in, int sizeOrg)
{
if (pre.size() == 1)
{
if (pre.size() == sizeOrg)
cout << pre[0];
else
cout << pre[0] << " ";
return;
}
else if(pre.size() == 0)
{
return;
}
int root = pre[0];
int i;
for(i =0;i<pre.size();i++)
{
if (in[i] == root)
break;
}
vector<int> preLeft(pre.begin() + 1, pre.begin() + i + 1);
vector<int> inLeft(in.begin(), in.begin() + i - 1 + 1);
convert(preLeft, inLeft, sizeOrg);
vector<int> preRight(pre.begin()+i + 1, pre.end());
vector<int> inRight(in.begin() + i +1, in.end());
convert(preRight, inRight, sizeOrg);
if (pre.size() == sizeOrg)
cout << pre[0];
else
cout << pre[0] << " ";
}
int main(void)
{
int n;
cin >> n;
getchar();
stack<int> s;
vector<int> preOrder;
vector<int> inOrder;
for (int i=0;i<n;)
{
char chs[30];
cin.getline(chs, 30);
string str(chs);
bool isPop = (str.compare(0,3,"Pop",0,3) == 0);
if (!isPop) // is push
{
string subStr = str.substr(5, str.length()-5+1);
int val = atoi(subStr.c_str());
s.push(val);
preOrder.push_back(val);
}
else
{
inOrder.push_back(s.top());
s.pop();
i++;
}
}
//vector<int> postOrder(n);
convert(preOrder, inOrder, preOrder.size());
return 0;
}