PTA-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.

Sample Input:

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

Sample Output:

4 1 5

---

解答

思路:
结构体数组建立树
层序遍历树 遇到左右儿子都为空的结点即为叶节点

#include<iostream>
#include<queue>
using namespace std;

struct Tree{
    int Lchild;
    int Rchild;
    int data;
}T[10];
int check[10]={0};
queue<int> q;
int Build(int n)
{
    char Lchild;
    char Rchild;
    if(n==0) return -1;//空树
    for(int i=0;i<n;i++){
        cin>>Lchild>>Rchild;
        T[i].data=i;
        if(Lchild=='-'){
            T[i].Lchild=-1;
        }else{
            T[i].Lchild=Lchild-'0';
            check[T[i].Lchild]=1;//表明该节点有父亲结点
        }
        if(Rchild=='-'){
            T[i].Rchild=-1;
        }else{
            T[i].Rchild=Rchild-'0';
            check[T[i].Rchild]=1;
        }
    }
        int Root;
        for(Root=0;Root<n;Root++){
            if(!check[Root]) break;//找到Root结点
        }
        return Root;
}
//层序遍历 输出叶子节点
void level_traversal(int Root)
{
    int temp;
    int flag=0;
    if(Root==-1) return;
    q.push(Root);
    while(!q.empty()){
        temp=q.front();
        q.pop();
        if(T[temp].Lchild==-1&&T[temp].Rchild==-1){
            if(flag==0){
                flag=1; 
                cout<<T[temp].data;
            }
            else cout<<" "<<T[temp].data;
        }
        if(T[temp].Lchild!=-1) q.push(T[temp].Lchild);
        if(T[temp].Rchild!=-1) q.push(T[temp].Rchild);
    }
}

int main()
{
    int n;
    int Root;
    cin>>n;
    Root=Build(n);
    level_traversal(Root);
    return 0;
}