7-6 Tree Traversals Again (25分)

7-6 Tree Traversals Again (25分)
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.

如图在这里插入代码片
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<bits/stdc++.h>
using namespace std;
vector<int> res;
int num;
int a[10010] , intern[10010];
int cnt = 0;
int ready = 0;
void Dfs(int n){
	if(ready == 2) return;
	int tempdata;
	string temp;	
	cin >> temp;
	if(temp == "Push"){
		cin >> tempdata;
		a[cnt++] = tempdata;

	}else {
	    if(cnt == num){
			ready ++;
		}
        return;
	}
	Dfs(n * 2 + 1);
	Dfs(n * 2 + 2);
	res.push_back(tempdata);
}
int main(){
	cin >> num;
	Dfs(0);
	for(int i = 0; i < num; i++){
		if( i== 0) cout << res[i];
		else cout << " " << res[i];
	}
	return 0;
}