1086. Tree Traversals Again (25) [树的遍历]

1 题目

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

2.思路

1.用栈的形式给出了树的遍历形式，栈弹出的是树的中序遍历，入栈顺序给出的是树的先序遍历
2.已知树的先序中序求后序模板，学自柳諾大神https://www.liuchuo.net/archives/2090

void pre(int root,int start,int end){
    if(start>end) return -1;
    int i=start ;
    while(i<end&&in[i]!=post[root]) i++;//找根
    printf("%d ",post[root]);
    pre(root-(end-i+1),start,i-1);往左子树递归，第一个根节点必须以根为基准运算
    pre(root-1,i+1,end);
}

3.题解

#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
vector<int> pre,in,post,value;

void postorder(int root,int start,int end){
    if(start>end) return;
    int i=start;
    while(i<end&&in[i]!=pre[root]) i++;
    postorder(root+1,start,i-1);
    postorder(root+1+i-start,i+1,end);
    post.push_back(pre[root]);
}

int main(){
    int n;
    cin>>n;
    char str[5];
    stack<int > s;
    int key=0;
    while (~scanf("%s", str)){
        if(strlen(str)==4){
            int num;
            cin>>num;
            value.push_back(num);
            pre.push_back(key);
            s.push(key++);
        }else{
            in.push_back(s.top());
            s.pop();
        }
    }
    postorder(0,0,n-1);
    cout<<value[post[0]];
    for(int i=1;i<n;i++){
        cout<<" "<<value[post[i]];
    }
    return 0;
}