A1102 Invert a Binary Tree（25分）PAT 甲级(Advanced Level) Practice（C++）满分题解【反转二叉树+层序遍历+中序遍历】

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.

Sample Input:

8
1 -
- -
0 -
2 7
- -
- -
5 -
4 6

Sample Output:

3 7 2 6 4 0 5 1
6 5 7 4 3 2 0 1

代码如下：

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct Node{
    int value,left,right,index,depth;
}node[10];
bool havefather[10];
vector<Node> levellist,inlist;
void inOrder(int root,int index,int depth)
{
    if(node[root].right!=-1)inOrder(node[root].right,2*index+2,depth+1);
    inlist.push_back({root,0,0,index,depth});
    if(node[root].left!=-1)inOrder(node[root].left,2*index+1,depth+1);
}
bool cmp(Node a,Node b)
{
    if(a.depth!=b.depth)return a.depth<b.depth;
    else return a.index>b.index;
}
int main()
{
    int n,root;
    cin>>n;
    for(int i=0;i<n;i++){
        string s1,s2;
        cin>>s1>>s2;
        if(s1=="-")node[i].left=-1;
        else node[i].left=stoi(s1);
        if(s2=="-")node[i].right=-1;
        else node[i].right=stoi(s2);
    }
    for(int i=0;i<n;i++)
    {
        if(node[i].left!=-1)havefather[node[i].left]=true;
        else havefather[node[i].left]=false;
        if(node[i].right!=-1)havefather[node[i].right]=true;
        else havefather[node[i].right]=false;
    }
    //find the root Node
    for(int i=0;i<n;i++)
    {
        if(!havefather[i]){
            root=i;
            break;
        }
    }
    inOrder(root,0,0);
    levellist=inlist;
    sort(levellist.begin(),levellist.end(),cmp);
    
    cout<<levellist[0].value;
    for(int i=1;i<n;i++)
        cout<<" "<<levellist[i].value;
    cout<<endl;

    cout<<inlist[0].value;
    for(int i=1;i<n;i++)
        cout<<" "<<inlist[i].value;
    cout<<endl;
}

运行结果如下：