pat1086 Tree Traversals Again（树的遍历）

题目：

1086 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.

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 "stack"
#include "algorithm"
#include "vector"
using namespace std;
int n;
int pre[30],in[30];
vector<int> post;
void postOrder(int preL,int preR,int inL,int inR){
    if (inL > inR) return;
    int i = inL;
    while (i<=inR && in[i]!=pre[preL]) i++;
    int numleft = i-inL;
    postOrder(preL+1,preL+numleft,inL,i-1);
    postOrder(preL+numleft+1,preR,i+1,inR);
    post.push_back(pre[preL]);
}
int main() {
    scanf("%d\n",&n);
    stack<int> m;
    string str;
    int j=0,k=0;
    for (int i = 0; i < 2*n; ++i) {
        getline(cin,str);
        if (str[1] == 'u') {
            int temp = str[5]-'0';
            pre[j++]=temp;
            m.push(temp);
        }
        if (str[1] == 'o') {
            int a=m.top();
            in[k++] = a;
            m.pop();
        }
    }
    postOrder(0,j-1,0,j-1);
    for (int i = 0; i < post.size() ; ++i) {
        if (i==0) printf("%d",post[i]);
        else printf(" %d",post[i]);
    }

}

更改了输入方式后就可以了，可能是getline导致的？

#include <iostream>
#include "stack"
#include "algorithm"
#include "vector"
#include "cstring"
using namespace std;
int n;
int pre[30],in[30];
vector<int> post;
void postOrder(int preL,int preR,int inL,int inR){
    if (inL > inR) return;
    int i = inL;
    while (i<=inR && in[i]!=pre[preL]) i++;
    int numleft = i-inL;
    postOrder(preL+1,preL+numleft,inL,i-1);
    postOrder(preL+numleft+1,preR,i+1,inR);
    post.push_back(pre[preL]);
}
int main() {
    scanf("%d\n",&n);
    stack<int> m;
    char str[5];
    int j=0,k=0;
    while (~scanf("%s",str)){
        if (strlen(str) == 4) {
            int temp;
            scanf("%d",&temp);
            pre[j++]=temp;
            m.push(temp);
        } else {
            int a=m.top();
            in[k++] = a;
            m.pop();
        }
    }
    postOrder(0,j-1,0,j-1);
    for (int i = 0; i < post.size() ; ++i) {
        if (i==0) printf("%d",post[i]);
        else printf(" %d",post[i]);
    }

}