102 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 <cstdio>
#include <queue>
#include <algorithm>
using namespace std;

const int maxn = 110;

struct node {//二叉树的静态写法
	int lchild;
	int rchild;
}Node[maxn];

bool notroot[maxn] = { false };

int n, num = 0;//num为当前输出的结点个数

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);

}

int strtonum(char c) {
	if (c == '-')return -1;
	else {
		notroot[c - '0'] = true;//标记
		return c - '0';
	}
}

int findroot() {
	for (int i = 0; i < n; i++) {
		if (notroot[i] == false) {
			return i;
		}
	}
}

int main() {
	char lchild, rchild;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%*c%c %c", &lchild, &rchild);//用%*c吸收一个换行符
		Node[i].lchild = strtonum(lchild);
		Node[i].rchild = strtonum(rchild);

	}

	int root = findroot();
	postorder(root);
	BFS(root);

	num = 0;//小心
	inorder(root);
	return 0;
}