PAT.A1102 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

 

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<stack>
using namespace std;
struct node {
	int data;
	node* lchild;
	node* rchild;
};							
const int maxn = 15;																				
int n,r,num=0;
int b[maxn][2];

void bfs(int b[][2]) {
	queue<int> q;
	q.push(r);
	while (!q.empty()) {
		int t = q.front();
		q.pop();
		printf("%d", t);
		if (b[t][0] != -1) q.push(b[t][0]);
		if (b[t][1] != -1) q.push(b[t][1]);
		if (!q.empty()) printf(" ");
    }
}
void inorder(int r) {	
	if (r==-1) return;
	inorder(b[r][0]);
	printf("%d", r);
	num++;
	if (num < n) printf(" ");
	inorder(b[r][1]);
}
int main() {
	memset(b, -1,sizeof(b));
	scanf("%d", &n);
	getchar();
	bool hashb[maxn] = { false };
	for (int i = 0; i < n; i++) {
		char c1, c2;
		scanf("%c %c", &c1, &c2);
		getchar();
		if (c1 != '-') { 
			b[i][1] = c1 - '0';
			hashb[c1 - '0'] = true; 
		}
		if (c2 != '-') {
			b[i][0] = c2 - '0';
			hashb[c2 - '0'] = true;
		}
	}
	for (int i = 0; i < n; i++) {
		if (hashb[i] == false) {
			r = i;
			break;
		}
	}
	bfs(b);
	printf("\n");
	inorder(r);
	return 0;
}