1102 Invert a Binary Tree

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
题意：
二叉树有N个结点（结点编号为0~N-1）,给出每个结点的左右孩子结点的编号，把该二叉树反转（即把每个结点的左右孩子都交换），输出反转后二叉树的层序遍历序列和中序遍历序列。

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn=110; 
struct node
{
	int lchild,rchild;
}Node[maxn];
bool notRoot[maxn]={false};//记录是否不是根结点，初始均是根结点
int n,num=0;//n为结点个数，num为已经输出的结点个数
//print函数输出结点id的编号 
void print(int id)
{
	printf("%d", id);
	num++;
	if(num<n)
	printf(" ");
	else printf("\n");	
} 
//中序遍历
void inOrder(int root)
{
	if(root==-1)
     {
     	return;
     }
     inOrder(Node[root].lchild);
     print(root);
     inOrder(Node[root].rchild);
} 
//层序遍历
void BFS(int root)
{
	queue<int> q;
	q.push(root);//入队
	while(!q.empty())
	{
		int now=q.front();
		q.pop();
		print(now);
		if(Node[now].lchild!=-1)
		q.push(Node[now].lchild);
		if(Node[now].rchild!=-1)
		q.push(Node[now].rchild);
	} 
} 
//后序遍历，用以反转二叉树
void postOrder(int root)
{
	if(root==-1)
	{
		return;
	}
	postOrder(Node[root].lchild);
    postOrder(Node[root].rchild);
    swap(Node[root].lchild,Node[root].rchild);
} 
//将输入的字符转换-1或者结点编号
int strToNum(char c) 
{
	if(c=='-')
	return -1;//"-"表示没有孩子结点，记为-1
	else
	{
		notRoot[c-'0']=true;//标记c不是根结点
		return c-'0';//返回结点编号 
	} 
}
//寻找根结点编号
int findRoot()
{
	for(int i=0;i<n;i++)
	{
		if(notRoot[i]==false)
		{
			return i;//是根结点，返回i 
		}
	}
} 
int main()
{
	char lchild,rchild;
	scanf("%d",&n);//结点个数
	for(int i=0;i<n;i++)
	{
		scanf("%*c%c %c", &lchild, &rchild);
		Node[i].lchild=strToNum(lchild);
		Node[i].rchild=strToNum(rchild);
	} 
	int root=findRoot();//获得根结点编号
	postOrder(root);//后序遍历，反转二叉树
	BFS(root);//输出层序遍历序列
	num=0;
	inOrder(root);//输出中序遍历序列
	return 0; 
}