pat1102 Invert a Binary Tree

题意：写出反转二叉树的层序和中序。

思路：直接写。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>

using namespace std;

const int MAX_N = 20;
int lc[MAX_N], rc[MAX_N];
char s1[3], s2[3];
int n, rt;
set<int> st;

void rev(int root) {
    if (root == -1) return ;
    swap(lc[root], rc[root]);
    rev(lc[root]);
    rev(rc[root]);
}

int lev[MAX_N], len = 0;
void level(int root) {
    len = 0;
    queue<int> q;
    q.push(root);
    while (!q.empty()) {
        int t = q.front(); q.pop();
        lev[len++] = t;
        if (lc[t] != -1) q.push(lc[t]);
        if (rc[t] != -1) q.push(rc[t]);
    }
}
void inorder(int root) {
    if (root == -1) return ;
    inorder(lc[root]);
    lev[len++] = root;
    inorder(rc[root]);
}

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d", &n);
    memset(lc, -1, sizeof(lc));
    memset(rc, -1, sizeof(rc));
    for (int i = 0; i < n; i++) st.insert(i);
    for (int i = 0; i < n; i++) {
        scanf("%s %s", s1, s2);
        if (s1[0] == '-') lc[i] = -1;
        else {lc[i] = atoi(s1); st.erase(lc[i]);}
        if (s2[0] == '-') rc[i] = -1;
        else {rc[i] = atoi(s2); st.erase(rc[i]);}
    }
    for (auto it = st.begin(); it != st.end(); it++) rt = *it;
    rev(rt);
    level(rt);
    for (int i = 0; i < len; i++) {
        if (i > 0) printf(" ");
        printf("%d", lev[i]);
        if (i == len-1) printf("\n");
    }
    len = 0;
    inorder(rt);
    for (int i = 0; i < len; i++) {
        if (i > 0) printf(" ");
        printf("%d", lev[i]);
        if (i == len-1) printf("\n");
    }
    return 0;
}