1102. Invert a Binary Tree (25)
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 6Sample Output:
3 7 2 6 4 0 5 1 6 5 7 4 3 2 0 1
#include<cstdio>
#include <queue>#include<iostream>
using namespace std;
const int maxn = 20;
struct Node{
int lchild;
int rchild;
int father;
}n[20];
int Count;
int findFather(int a){
while(n[a].father!=-1){
a= n[a].father;
}
return a;
}
void levelOrder(int start,int num){
queue<int> q;
q.push(start);
while(!q.empty()){
int front = q.front();
q.pop();
printf("%d",front);
num--;
if(num!=0){
printf(" ");
}
if(n[front].lchild!=-1){
q.push(n[front].lchild);
}
if(n[front].rchild!=-1){
q.push(n[front].rchild);
}
}
printf("\n");
}
void inOrder(int start){
if(start==-1){
return;
}
inOrder(n[start].lchild);
printf("%d",start);
Count--;
if(Count!=0){
printf(" ");
}
inOrder(n[start].rchild);
}
void invertTree(int root){
if(root == -1){
return;
}
int temp;
temp = n[root].lchild;
n[root].lchild = n[root].rchild;
n[root].rchild = temp;
invertTree(n[root].lchild);
invertTree(n[root].rchild);
}
int main(){
for(int i=0;i<maxn;i++){
n[i].lchild = n[i].rchild = n[i].father = -1;
}
int num;
scanf("%d",&num);
Count = num;
getchar();
for(int i=0;i<num;i++){
string a,b;
cin>>a>>b;
// scanf("%s%s",&a,&b);
if(a[0]>='0'&&a[0]<='9'){
n[i].lchild = a[0]-'0';
n[n[i].lchild].father = i;
}else{
n[i].lchild = -1;
}
if(b[0]>='0'&&b[0]<='9'){
n[i].rchild = b[0]-'0';
n[n[i].rchild].father = i;
}else{
n[i].rchild = -1;
}
}
int root = findFather(0);
invertTree(root);
levelOrder(root, num);
inOrder(root);
printf("\n");
return 0;
}