1102 Invert a Binary Tree (25 point(s))

思路：

每个节点保存左孩子，右孩子，和双亲节点，利用双亲结点找到根节点root，然后就可以从根结点层次遍历，和中序遍历，遍历顺序从右到左。

1102 Invert a Binary Tree (25 point(s))

The following is from Max Howell @twitter:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.

Now it's your turn to prove that YOU CAN invert a binary tree!

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N−1. Then N lines follow, each corresponds to a node from 0 to N−1, and gives the indices of the left and right children of the node. If the child does not exist, a - will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each test case, print in the first line the level-order, and then in the second line the in-order traversal sequences of the inverted tree. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

Example:

#include<iostream>
#include<vector>
#include<deque>
#include<cstring>
using namespace std;

struct Tree {
    int left;
    int right;
    int parent;
};
bool first;

void levelOrder(vector<Tree> &T, deque<int> &Q)
{
    first = true;
    while(!Q.empty()) {
        int node = Q.front();
        Q.pop_front();
        cout << (first?first=false,"":" ") << node;
        if(T[node].right != -1) Q.push_back(T[node].right);
        if(T[node].left != -1) Q.push_back(T[node].left);
    }
}

void inOrder(vector<Tree> &T, int root)
{
    if(T[root].right != -1) inOrder(T, T[root].right);
    cout << (first?first=false,"":" ") << root;
    if(T[root].left != -1) inOrder(T, T[root].left);
}

void input(vector<Tree> &T, int N)
{
    for(int i = 0 ; i < N ; i++) {
        char left, right;
        cin >> left >> right;
        if(left != '-')  {
            T[i].left = left - '0';
            T[T[i].left].parent = i;
        }
        if(right != '-') {
            T[i].right = right - '0';
            T[T[i].right].parent = i;
        }
    }
}

int main()
{
    int N;
    cin >> N;
    vector<Tree> T(N, {-1,-1,-1});
    input(T, N);
    int root = -1;
    for(int i = 0 ; i < N ; i++) {
        if(T[i].parent == -1) { root = i; break; }
    }
    first = true;
    deque<int> Q;
    Q.push_back(root);
    levelOrder(T, Q);
    cout << endl;
    first = true;
    inOrder(T, root);
    cout << endl;
}