PAT(Advanced Level) 1102 Invert a Binary Tree

给出 n 个结点和每个结点对应的左右孩子，创建一个二叉树，然后翻转它，输出它的层序和中序遍历

1. 二叉树的翻转就是每个结点的左、右结点进行交换
2. 根结点是所有左右结点中没有出现的那个结点，通过 visit 数组判断

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
typedef struct Node{
    int data;
    int left,right;
}node;
int root;
vector<node> tree(10);
queue<int> level;
vector<int> levelord , inord;

void level_order(int root){
    level.push(root);
    while(!level.empty()){
        int front = level.front();
        levelord.push_back( front );
        level.pop();
        if(tree[front].left != -1) level.push(tree[front].left);
        if(tree[front].right != -1) level.push(tree[front].right);
    }
}

void in_order(int root){
    if(tree[root].left != -1)  in_order(tree[root].left);
    inord.push_back(root);
    if(tree[root].right != -1)  in_order(tree[root].right);
}

int main(){
    int n;
    cin >> n;
    vector<int> visit(n,0);
    char l,r;
    for(int i=0;i<n;i++){
        cin >> l >> r;
        tree[i].data = i;
        (l != '-') ? visit[l-'0'] = 1 : 1 ;
        (r != '-') ? visit[r-'0'] = 1 : 1 ;
        (l != '-') ? tree[i].right = l - '0' : tree[i].right = -1 ;
        (r != '-') ? tree[i].left = r - '0' : tree[i].left = -1 ;
    }
    for(int i=0;i<n;i++){
        if(visit[i] == 0)  root = i;
    }
    level_order(root);
    in_order(root);
    for(unsigned int i=0;i<levelord.size();i++){
        (i == 0) ? cout << levelord[i] : cout << " " << levelord[i];
    }
    cout << endl;
    for(unsigned int i=0;i<inord.size();i++){
        (i == 0) ? cout << inord[i] : cout << " " << inord[i];
    }
}