1102 Invert a Binary Tree

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

AC代码

#include <iostream>
#include <algorithm>
#include <queue> 
using namespace std;

struct node{
	int lchild = -1, rchild = -1;
}BTree[11];

int cnt = 0, i = 0;
void levelorder(int root){
	queue<int> Q;
	Q.push(root);
	while(!Q.empty()){
		int top = Q.front();
		Q.pop();
		cnt++;
		if(cnt != 1) cout<<" ";
		cout<<top;
		if(BTree[top].rchild != -1)
			Q.push(BTree[top].rchild);
		if(BTree[top].lchild != -1)
			Q.push(BTree[top].lchild);
	}
	cout<<endl;
}

void inorder(int root){
	if(root == -1) return;
	inorder(BTree[root].rchild);
	i++;
	if(i != 1) cout<<" ";
	cout<<root;
	inorder(BTree[root].lchild);
}

int main(){
	int n, root;
	char l, r;
	int hashTable[11] = {0}; //根结点即未在孩子结点中出现过的点 
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>l>>r;
		if(l != '-'){
			hashTable[l -'0'] = 1;
			BTree[i].lchild = l - '0';
		}
		if(r != '-'){
			hashTable[r -'0'] = 1;
			BTree[i].rchild = r - '0';
		}
	}
	for(int i = 0; i < n; i++)
		if(hashTable[i] == 0){
			root = i;
			break;
		}
	levelorder(root);
	inorder(root);
	return 0;
}