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.
Sample Input:

#include <stdio.h>
#define MaxSize 10
#define Tree int
#define Null -1
int CountLeaves;//叶子结点个数
struct TreeNode{
    Tree Left;
    Tree Right; //这里不设Data，索引值就表示了结点值。
}T[MaxSize];
Tree BuildTree();
void PrintLeaves();
int main(){
    Tree r;
    r = BuildTree();
    PrintLeaves(r);
}

Tree BuildTree(){
    int i;
    Tree Check[MaxSize];
    Tree Root;
    char TL, TR;
    int N;
    scanf("%d", &N);
    getchar();
    if(N){
        for(i = 0; i < N; i++){
            Check[i] = 0;
        }
        for(i = 0; i < N; i++){
            scanf("%c %c", &TL, &TR);
            getchar();
            if(TL != '-'){
                T[i].Left = TL - '0';
                Check[T[i].Left] = 1;
            }else{
                T[i].Left = Null;
            }

            if(TR != '-'){
                T[i].Right = TR - '0';
                Check[T[i].Right] = 1;
            }else{
                T[i].Right = Null;
            }     
            if((TR == '-') && (TL == '-')) CountLeaves++;      
        }
    }else{
        return Null;
    }
    for(i = 0; i < N; i++){
        if(!Check[i]) break;//找到根结点
    }
    Root = i;
    return Root;
}
void PrintLeaves(Tree Root){
    int Queue[MaxSize], Front, Rear; //队列实现层序遍历，这里只操作一遍就不用了循环队列了
    Tree P;
    Front = Rear = -1;
    Queue[++Rear] = Root;
    while(Front != Rear){
        P = Queue[++Front];
        if(T[P].Left != Null) Queue[++Rear] = T[P].Left;
        if(T[P].Right != Null) Queue[++Rear] = T[P].Right;
        if(T[P].Left == Null && T[P].Right == Null){
            printf("%d", P);
            CountLeaves--;
            if(M) printf(" "); //M的作用就是为了不输出最后一个空格，符合题意。
        }
    }
}