1086. Tree Traversals Again (25)

先创建树再输出即可，注意数据和位置不要搞错

#include<iostream>
#include<vector>
#include<string>
#pragma warning(disable:4996)
using namespace std;

struct Node {
    int data;
    Node *lchild, *rchild;
    Node() { lchild = rchild = NULL;}
    bool operator==(const Node b) const
    {
        return data == b.data &&lchild == b.lchild&&rchild == b.rchild;

    }
};
vector<Node> all;

void PostOrder(Node *root)
{
    if (root == NULL) return;
    PostOrder(root->lchild);
    PostOrder(root->rchild);
    printf("%d", root->data);
    if (!(*root == all[0])) printf(" ");
}
int main()
{
    vector<int> xx;
    int N;
    cin >> N;
    all.resize(N);

    int flag = 0;int x, cnt = 0;int R=-1;
    for (int t = 0;t < 2 * N;t++)//创建树
    {
        string tem;
        cin >> tem;
        if (tem[1] == 'u')
        {
            cin >> x;
            all[cnt++].data = x;
            if (R == -1) R = cnt - 1;
            else if (flag == 1) {
                all[R].rchild = &all[cnt - 1];
                R = cnt - 1;
            }
            else
            {
                all[R].lchild = &all[cnt - 1];
                R = cnt - 1;
            }
            flag = 0;
            xx.push_back(cnt-1);
        }
        else
        {
            R = xx.back();
            xx.pop_back();
            flag = 1;
        }
    }
    Node *root = &all[0];//输出
    PostOrder(root);
}