PAT——1086 Tree Traversals Again (25 分)（先序+中序构建二叉树）

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 <stdio.h>
#include <vector>
#include <stack>
#include <string.h>
using namespace std;

int n;
stack<int> sstack;
vector<int> pre, in, post;

typedef struct node
{
    int data;
    node *left;
    node *right;
}node;

void input()
{
    scanf("%d", &n);
    for(int i = 0; i < 2 * n; i++)
    {
        char str[5];
        scanf("%s",str);
        if(strcmp(str, "Push") == 0)
        {
            int num;
            scanf("%d", &num);
            pre.push_back(num); //先序序列直接得出
            sstack.push(num);
        }
        else if(strcmp(str, "Pop") == 0)
        {
            int num = sstack.top();
            in.push_back(num);
            sstack.pop();
        }
    }
}

node *create(int preL, int preR, int inL, int inR)
{
    if(preL > preR || inL > inR)
    {
        return NULL;
    }
    int data = pre[preL];//第一个为根
    node *root = new node;
    root->data = data;
    int k;
    for(int i = inL; i <= inR; i++)
    {
        if(in[i] == data)
        {
            k = i;
            break;
        }
    }

    root->left = create(preL+1, preL+k-inL, inL, k-1);
    root->right = create(preL+k-inL+1, preR, k+1, inR);
    return root;
}

void postorder(node *root)
{
    if(root == NULL)
    {
        return;
    }
    postorder(root->left);
    postorder(root->right);
    post.push_back(root->data);
}

int main()
{
    /*1086 Tree Traversals Again (25 分)*/
    #ifndef ONLINE_JUDGE
        freopen("test.txt", "r", stdin);
    #endif // ONLINE_JUDGE

    input();

    node *root = create(0, n-1, 0, n-1);

    postorder(root);
    cout << post[0];
    for(int i = 1; i < n; i++)
        cout<<" "<<post[i];
    return 0;
}