03-树3 Tree Traversals Again

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.

 

#include <iostream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

//通过先序和中序得到后序
void getPostorder(vector<int> preOrder, int preL, vector<int> inOrder, int inL,
                  vector<int> &postOrder, int postL, int n);

int main()
{
    int N;
    cin >> N;
    //push代表前序遍历，pop出的顺序代表中序遍历
    vector<int> preorder, inorder, postorder(N);
    //接收输入,得到前序遍历和中序遍历
    stack<int> stk;
    for(int i = 0; i < 2*N; i++){
        string str;
        int tmp;
        cin >> str;
        if(str == "Push"){
            cin >> tmp;
            preorder.push_back(tmp);
            stk.push(tmp);
        }else if(str == "Pop"){
            if(!stk.empty()) {
                tmp = stk.top();
                inorder.push_back(tmp);
                stk.pop();
            }
        }
    }
       
    //将先序和中序转换为后序
    getPostorder(preorder, 0, inorder, 0, postorder, 0, N);
    for(int i = 0; i < N; i++){
        if(i == 0) cout << postorder[i];
        else cout << " " << postorder[i];
    }
    return 0;
}

//通过先序和中序得到后序
/*
参数：preOrder 先序数组; inOrder 中序数组; postOrder 后序数组;
preL: 先序数组的起始点，所要处理的长度是n，即区间[preL, preL + n)
inL: 中序数组的起始点，所要处理长度是n，即区间[inL, inL + n)
postL: 后序数组的起始点，所要处理长度是n，即区间[postL, postL + n)
*/
void getPostorder(vector<int> preOrder, int preL, vector<int> inOrder, int inL,
                  vector<int> &postOrder, int postL, int n)
{
    if (n == 0) return ;
    if (n == 1) {
        postOrder[postL] = preOrder[preL];
        return ;
    }
    auto root = preOrder[preL];
    postOrder[postL + n - 1] = root;    //放在区间的最后一位，后序遍历
    //在中序遍历数组上找出root的位置
    int i = 0;
    while (i < n) {
        if (inOrder[inL + i] == root) break;
        ++i;
    }
    // 计算出root节点左右子树节点的个数
    int L = i, R = n - i - 1;
    // 递归的进行求解
    getPostorder(preOrder, preL + 1, inOrder, inL, postOrder, postL, L);
    getPostorder(preOrder, preL + L + 1, inOrder, inL + L + 1, postOrder, postL + L, R);
}