1102 Invert a Binary Tree (25分)

 

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 6

Sample Output:

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

 

#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<unordered_map>
#include<queue>
#include<climits>
#include<stack>
using namespace std;
const int maxn= 10000+10;

struct Node{
	int id,l,r,index,lever;
		
}a[maxn],b[maxn],c[maxn];


int n,k=0;

bool cmp(Node x,Node y){
	if(x.lever!=y.lever) return x.lever<y.lever;
	return x.index>y.index;
	
}

int cnt=0;
void inorder(int root ,int index,int lever){

		if(a[root].r!=-1) inorder(a[root].r,index*2+2,lever+1);
		c[cnt++]={root,0,0,index,lever};
		if(a[root].l!=-1) inorder(a[root].l,index*2+1,lever+1);
	
	
}

int main(){
	cin>>n;
	int have[maxn]={0};
	int root=0;
	for(int i=0;i<n;i++){
		a[i].id=i;
		string l,r;
		cin>>l>>r;		
		if(l=="-"){
			a[i].l=-1;		
		}else{
			a[i].l=stoi(l);	
			have[stoi(l)]=1;		
		}
		if(r=="-"){
			a[i].r=-1;		
		}else{
			a[i].r=stoi(r);	
			have[stoi(r)]=1;		
		}
	}
	while(have[root]==1) root++;
	inorder(root,0,0);
	for(int i=0;i<n;i++){
		b[i]=c[i];	
	}
		sort(c,c+n,cmp); 
	for(int i=0;i<n;i++) {
		if(i!=0) cout<<" ";
		cout<<c[i].id;
	} 
	cout<<endl;

	for(int i=0;i<n;i++) {
		if(i!=0) cout<<" ";
		cout<<b[i].id;
	} 
    return 0;
}