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 (≤) 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:

 -
- -
 -

- -
- -
 -
 

Sample Output:

给定一棵树，您应该按照自上而下和从左到右的顺序列出所有叶子。

 #include <stdio.h>
 #include <queue>
 #include <algorithm>
 #define MaxTree 11
 #define Null -1
 using namespace std;

 int check[MaxTree];
 int P[MaxTree];
 int num=;
 queue<int> qu;

 struct TreeNode
 {
     int Left;
     int Right;
 }T[MaxTree];

 int BuildTree(struct TreeNode T[])
 {
     int N,i;
     char le,ri;
     int Root;
     scanf("%d\n",&N);
     if(N)
     {
         for(i=;i<N;i++)
         {
             check[i]=;
         }
         for(i=;i<N;i++)
         {
             scanf("%c %c\n",&le,&ri);
             if(le!='-')
             {
                 T[i].Left=le-'';
                 check[T[i].Left]=;
             }
             else T[i].Left=Null;
             if(ri!='-')
             {
                 T[i].Right=ri-'';
                 check[T[i].Right]=;
             }
             else T[i].Right=Null;
         }
         for(i=;i<N;i++)
         {
             if(!check[i]) break;
         }
         Root = i;
     }
     else
     {
         Root=Null;
     }
     return Root;
 }

 void search(int Tree)
 {
     if(Tree!=Null)
     {
         qu.push(Tree);
         while(!qu.empty())
         {
             int k;
             k=qu.front();
             if(T[k].Left==Null&&T[k].Right==Null)
                 P[num++]=k;
             qu.pop();;
             if(T[k].Left!=Null)
                 qu.push(T[k].Left);
             if(T[k].Right!=Null)
                 qu.push(T[k].Right);
         }
     }
     else return;
 }

 int main()
 {
     int Tree;
     Tree=BuildTree(T);
     search(Tree);
     int i;
     for(i=;i<num;i++)
     {
         if(i==)
             printf("%d",P[i]);
         else printf(" %d",P[i]);
     }
     return ;
 }