1102. Invert a Binary Tree

好久没做树的题啦！

#include <stdio.h>
#include <string.h>
typedef struct TreeNode{
	int left;
	int right;
}Node;
typedef struct Queue {
	int data[100];
	int front;
	int rear;
}Queue;
Node T[20];
int cnt = 0,n;
Queue Q;
void Level(int root);
void In(int root);
void EnQueue(int x);
int DeQueue();
int main()
{
	int i,IsRoot[20],root;
	char child[5];
	scanf("%d", &n);
	for (i = 0; i < n; i++)
		IsRoot[i] = 1;
	for (i = 0; i < n; i++) {
		scanf("%s", child);
		if (child[0] == '-')
			T[i].right = -1;
		else {
			if (strlen(child) == 1)
				T[i].right = child[0] - '0';
			else T[i].right = (child[0] - '0') * 10 + child[1] - '0';
			IsRoot[T[i].right] = 0;
		}
		scanf("%s", child);
		if (child[0] == '-')
			T[i].left = -1;
		else {
			if (strlen(child) == 1)
				T[i].left = child[0] - '0';
			else T[i].left = (child[0] - '0') * 10 + child[1] - '0';
			IsRoot[T[i].left] = 0;
		}
	}
	for (root = 0; root < n; root++)
		if (IsRoot[root])
			break;
	Level(root);
	In(root);
	return 0;
}

void Level(int root)
{
	int node;
	Q.front = Q.rear = 0;
	EnQueue(root);
	printf("%d", root);
	while (Q.front != Q.rear) {
		node = DeQueue();
		if (T[node].left != -1) {
			EnQueue(T[node].left);
			printf(" %d", T[node].left);
		}

		if (T[node].right != -1) {
			EnQueue(T[node].right);
			printf(" %d", T[node].right);
		}
	}
	printf("\n");
}

void EnQueue(int x)
{
	Q.data[Q.rear++] = x;
}

int DeQueue()
{
	return Q.data[Q.front++];
}

void In(int root)
{
	if (root == -1)
		return;
	In(T[root].left);
	printf("%d",root);
	if (cnt != n-1)
		printf(" ");
	cnt++;
	In(T[root].right);
}