浙大PAT遍历叶子结点：7-4 List Leaves

7-4 List Leaves (25分)
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.

Sample Input:

8
1 —
0 —
2 7
— —
— —
5 —
4 6

Sample Output:

4 1 5

#include <stdio.h> 
#include <malloc.h>
#include <string.h>
#define ElementType int
#define Tree int
#define MaxTreeNode 10
#define null -1

struct TreeNode{
	ElementType Element;
	Tree left;
	Tree right;
}T1[MaxTreeNode];

typedef struct Queue{
	struct TreeNode T[MaxTreeNode];
	Tree front;
	Tree tail; 
}*Queue;

void InitQueue(Queue Q){
	Q->front = 0;
	Q->tail = 0;
}

void EnQueue(Queue Q,Tree N){
	if(N==null)	return;
	memcpy(&(Q->T[Q->tail++]),&T1[N],sizeof(struct TreeNode));
}

Tree DeQueue(Queue Q){
	return Q->T[Q->front++].Element;
} 

int IsEmpty(Queue Q) {
	if(Q->front==Q->tail)
		return 1;
	else 
		return 0;
}
Tree CreatTree(struct TreeNode T[]){//传递的空数组 
	Tree root = null;
	char cl,cr;
	int N,i;
	scanf("%d\n",&N);
	int check[MaxTreeNode] = {0};
	
	if(N){
		for(i=0;i<N;i++){
			scanf("%c %c\n",&cl,&cr);
            T[i].Element = i;
			if(cl!='-'){
				T[i].left = cl-'0';
				check[T[i].left]  = 1;
			}
			else {
				T[i].left = null;
			}	
			if(cr!='-'){
				T[i].right = cr-'0';
				check[T[i].right]  = 1;
			}
			else {
				T[i].right = null;
			}
		}
		for(i=0;i<N;i++){
			if(check[i]==0)
				break;
		}
		root = i;
	}
	return root;
}

void LevelOrder(Tree N){
	Queue Q = (Queue)malloc(sizeof(struct Queue));
	int IsFirst = 1; 
	Tree P;
	InitQueue(Q);
	EnQueue(Q,N);
	while(!IsEmpty(Q)){
		P = DeQueue(Q);
		if(T1[P].left==null&&T1[P].right==null){	
			if(IsFirst==1)
				printf("%d",T1[P].Element);
			else
				printf(" %d",T1[P].Element);
			IsFirst = 0;
		}
		if(T1[P].left!=null)
			EnQueue(Q,T1[P].left);
		if(T1[P].right!=null)
			EnQueue(Q,T1[P].right);
	}
} 

int main(){
	freopen("1.txt","r",stdin);
	Tree r1;
	r1 = CreatTree(T1);
	LevelOrder(r1);
	return 0;
}