03-树2 List Leaves

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

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, 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 one line all the leaves’ indices in the order of top down, and left to right. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

#include<iostream>
using namespace std;

struct TreeNode {
	int left;
	int right;
} T[10];

typedef struct QueueNode* Queue;

struct QueueNode {
	int* Data;
	int front, rear;
};

int flag = 0;

int Read();
void Leaves(int R);
void PrintLeaves(int R);
Queue CreateQueue();
void AddQ(Queue Q, int TN);
int DeleteQ(Queue Q);
bool IsEmpty(Queue Q);


int main()
{
	int root = Read();
	Leaves(root);
}

int Read()
{
	int i, N, root;
	char cl, cr;
	int check[10];

	cin >> N;
	for (i = 0; i < N; i++) check[i] = 0;
	for (i = 0; i < N; i++) {
		cin >> cl >> cr;
		if (cl != '-') {
			T[i].left = cl - '0';
			check[T[i].left] = 1;
		}
		else T[i].left = -1;
		if (cr != '-') {
			T[i].right = cr - '0';
			check[T[i].right] = 1;
		}
		else T[i].right = -1;
	}
	for (i = 0; i < N; i++) {
		if (!check[i]) break;
	}
	root = i;
	return root;
}

//采用队列层序遍历,取出来一个值后放入它的左右两值
void Leaves(int R)
{
	Queue Q;
	int TR;
	Q = CreateQueue();
	AddQ(Q, R);
	while (!IsEmpty(Q)) {
		TR = DeleteQ(Q);
		PrintLeaves(TR);
		if (T[TR].left != -1) AddQ(Q, T[TR].left);
		if (T[TR].right != -1) AddQ(Q, T[TR].right);
	}
}

//判断是否为叶子节点
void PrintLeaves(int R)
{
	if (T[R].left == -1 && T[R].right == -1) {
		if (!flag) {
			cout << R;
			flag = 1;
		}
		else cout << " " << R;
	}
}

Queue CreateQueue()
{
	Queue Q; 
	Q = (Queue)malloc(sizeof(struct QueueNode));
	Q->Data = (int*)malloc(10 * sizeof(int));
	Q->front = Q->rear = 0;
	return Q;
}

//因为树是数组存储,所以只在队列存储其下标即可
void AddQ(Queue Q, int TN)
{
	Q->rear = (Q->rear + 1) % 10;
	Q->Data[Q->rear] = TN;
}

int DeleteQ(Queue Q)
{
	Q->front = (Q->front + 1) % 10;
	return Q->Data[Q->front];
}

bool IsEmpty(Queue Q)
{
	return (Q->front == Q->rear);
}